Simple-Semi-Conditional Versions of Matrix Grammars with a Reduced Regulating Mechanism
Alexander Meduna ; Tomáš Kopeček
Computing and Informatics, Tome 28 (2012) no. 1, / Harvested from Computing and Informatics
Text on Computing and Informatics
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.
Publié le : 2012-01-26
Classification:  Descriptional complexity; matrix grammars; simple semi-conditional grammars 
@article{cai430,
     author = {Alexander Meduna and Tom\'a\v s Kope\v cek},
     title = {Simple-Semi-Conditional Versions of Matrix Grammars with a Reduced Regulating Mechanism},
     journal = {Computing and Informatics},
     volume = {28},
     number = {1},
     year = {2012},
     language = {en},
     url = {http://dml.mathdoc.fr/item/cai430}
}

Alexander Meduna; Tomáš Kopeček. Simple-Semi-Conditional Versions of Matrix Grammars with a Reduced Regulating Mechanism. Computing and Informatics, Tome 28 (2012) no. 1, . http://gdmltest.u-ga.fr/item/cai430/