Inference of Uniquely Terminating EML

Authors:
S. Kannamma;D. G. Thomas;K. Rangarajan
Affiliations:
S.D.N.B. Vaishnav College for Women, Chennai, 600 044;Madras Christian College, Chennai, 600 059;Madras Christian College, Chennai, 600 059
Venue:
ICGI '08 Proceedings of the 9th international colloquium on Grammatical Inference: Algorithms and Applications
Year:
2008

Citing 4
Cited 0

Inferring uniquely terminating regular languages from positive data

Information Processing Letters
A note on inferring uniquely terminating code languages

Information Processing Letters
Petri Net Theory and the Modeling of Systems

Petri Net Theory and the Modeling of Systems
Learning code regular and code linear languages

ICG! '96 Proceedings of the 3rd International Colloquium on Grammatical Inference: Learning Syntax from Sentences

Quantified Score

Hi-index	0.00

Visualization

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.