Multigenerative Grammar Systems

• Autorzy: Meduna A. , Lukas R.
• Języki publikacji: EN

Abstrakty

EN

This paper presents new models for all recursive enumerable languages. These models are based on multigenerative grammar systems that simultaneously generate several strings in a parallel way. The components of these models are context -free grammars, working in a leftmost way. The rewritten nonterminals are determined by a finite set of nonterminal sequences.

Słowa kluczowe

EN

grammar system; context-free grammar; leftmost derivation

• Wydawca: Wydawnictwo Uniwersytetu Jagiellońskiego
• Czasopismo: Schedae Informaticae
• Rocznik: 2006
• Tom: Vol. 15
• Strony: 175--188
• Opis fizyczny: Bibliogr. 8 poz.

Twórcy

autor

Meduna A.

autor

Lukas R.

• Brno University of Technology, Department of Information Systems Faculty of Information Technology Bozetechova 2, Brno 61266, Czech Republic,

Bibliografia

• [1]  Csuhaj-Varju E.,  Dassow J., Kelemen J., Paun Gh.; Grammar A Grammatical Approach to Distribution and Cooperation, Gordon arid London 1994.
• [2]  Dassow J., Paun Gh., Rozenberg G.; Grammar Systems, in: G. A. Salomaa, (eds.), Handbook of Formal Languages, Vol. 2, Springer,
• [3]  Harrison M.A.; Introduction to Formal Language Theory, Addison-Wesley,. 1978.
• [4]  Meduna A.; Automata and Languages: Theory and Applications, Springer. 2000.
• [5]  Meduna A.; Two-Way Metalinear PC Grammar Systems and Their Complexity, Acta Cybemetica, 2003.
• [6] Paun Gh., Salomaa A., Vicolov S.; On the generative capacity of pardW communicating grammar systems, International Journal of Compear Mathematics, 45, 1992, pp. 45-59.
• [7]  Salomaa A.; Formal Languages, Academic Press, New York 1973.
• [8] Vaszil G.; On simulating Non-returning PC grammar systems with returning systems, Theoretical Computer Science, 209(1-2), 1998, pp. 319-329.