Abstract
In [3], we have provided an algorithm to infer a few subclasses of linear languages through labeled extended Petri nets. The family of equal matrix languages [6] meets both the families of context sensitive languages and context-free languages. In this paper, we prove that an equal matrix language is a Petri net language.We construct labeled extended Petri nets to infer uniquely terminating code k-equal matrix languages (utCk-EMLs), a subclass of EMLs. A similar algorithm can be employed to construct a labeled Petri net which generates a uniquely terminating regular language [4]. This algorithm can be modified to infer a given uniquely terminating code regular language [2] through a labeled extended Petri net.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Emerald, J.D., Subramanian, K.G., Thomas, D.G.: Learning code regular and code linear languages. In: Miclet, L., de la Higuera, C. (eds.) ICGI 1996. LNCS, vol. 1147, pp. 211–221. Springer, Heidelberg (1996)
Emerald, J.D., Subramanian, K.G., Thomas, D.G.: A note on inferring uniquely terminating code languages. Information Processing Letters 70, 217–222 (1999)
Kannamma, S., Thomas, D.G., Rangarajan, K.: On inference of uniquely terminating linear languages. In: Thangavel, K., Balasubramaniam, P. (eds.) Computing and Mathematical Modeling, pp. 291–298. Narosa Publishing House (2006)
Makinen, E.: Inferring uniquely terminating regular languages from positive data. Information Processing Letters 62, 57–60 (1997)
Peterson, J.L.: Petri net theory and modeling of systems. Prentice Hall, Englewood Cliffs (1981)
Siromoney, R.: On equal matrix languages. Information and control 14, 135–151 (1969)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kannamma, S., Thomas, D.G., Rangarajan, K. (2008). Inference of Uniquely Terminating EML. In: Clark, A., Coste, F., Miclet, L. (eds) Grammatical Inference: Algorithms and Applications. ICGI 2008. Lecture Notes in Computer Science(), vol 5278. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-88009-7_25
Download citation
DOI: https://doi.org/10.1007/978-3-540-88009-7_25
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-88008-0
Online ISBN: 978-3-540-88009-7
eBook Packages: Computer ScienceComputer Science (R0)