Learning of finite coded Petri net languages

Journal of Combinatorial Mathematics and Combinatorial Computing

Volumn 67, Issue , 2008, Pages 223-234

  Kannamma, S ^a   Thomas, D G ^b   Rangarajan, K ^b  

^a SDNB Vaishnav College for Women   (India)

^b MADRAS CHRISTIAN COLLEGE   (India)

Author keywords

Automata; Codes; Concurrency; Learning; Petri net

Indexed keywords

AUTOMATA; CODES; CONCURRENCY; LEARNING; PETRI NET;

EDUCATION; GRAPH THEORY; LINGUISTICS; PETRI NETS; QUERY LANGUAGES; TRANSLATION (LANGUAGES);

LEARNING ALGORITHMS;

EID: 78651557332     PISSN: 08353026     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (12)

1. D. Angluin, Inference of reversible languages, J. ACM 29, 741-765, 1982.
2. J. Berstel and B. Perrin, Theory of codes, Academic Press, NY, London, 1985.
3. J. D. Emerald, K. G. Subramanian, D. G. Thomas, Learning code regular and code linear languages, Proc. of ICGI - 96, Lecture Notes in Artificial Intelligence, Vol. 1147, Springer, Berlin, 211-221, 1995.
4. E. M. Gold, Language identification in the limit, Information and Control, Vol. 10, 447-474, 1967.
5. K. Hiraishi, Construction of a class of safe Petri nets by presenting firing sequences, Application and theory of Petri nets, Lecture Notes in Computer Science, Vol. 616, 224-262, 1992.
6. E. Makinen, The grammatical inference problem for the Szilard language of linear grammars, Information Processing Letters, Vol. 36, 203-206, 1990.
7. T. Murata, Petri nets, Properties, Analysis and Application, Proceedings of the IEEE, Vol. 77, No. 4, 541-480, 1989.
8. J. L. Peterson, Computation sequence sets, Journal of Computer System Science, Vol. 13, No. 1, 1-24, 1976.
9. J. L. Peterson, Petri nets, ACM Computing Surveys, Vol. 9, No. 3, 223-252, 1997.
10. J. L. Peterson, Petri net theory and modeling of Systems, Prentice Hall Inc., Englewood Cliffs, NJ, 1981.
11. N. Tanida, T. Yokomori, Polynomial time identification of strictly regular languages in the limit, IEICE Trans. Inform. Syst., E 75. D, 125-132, 1992.
12. K. Thirusangu, K. Rangarajan, A note on the construction of marked graphs, Information Processing Letters, Vol. 55, 211-215, 1995.