Document info



In: Computing and Informatics, vol. 23, no. 3
Alexander Meduna - Tomáš Kopeček

Simple-Semi-Conditional Versions of Matrix Grammars with a Reduced Regulating Mechanism

Details:

Year, pages: 2004, 287 - 302
Keywords: Descriptional complexity, matrix grammars, simple semi-conditional grammars

About article:

This paper discusses some conditional versions of matrix grammars. It establishes several characterizations of the family of the recursively enumerable languages based on these grammars. In fact, making use of the Geffert Normal forms, the present paper demonstrates these characterizations based on matrix grammars with conditions of a limited length, a reduced number of nonterminals, and a reduced number and size of matrices.

How to cite:

ISO 690:
Meduna, A., Kopeček, T. 2004. Simple-Semi-Conditional Versions of Matrix Grammars with a Reduced Regulating Mechanism. In Computing and Informatics, vol. 23, no.3, pp. 287-302. 1335-9150.

APA:
Meduna, A., Kopeček, T. (2004). Simple-Semi-Conditional Versions of Matrix Grammars with a Reduced Regulating Mechanism. Computing and Informatics, 23(3), 287-302. 1335-9150.