Abstract

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.

Keywords

Cite this article

@article{cai-1241,
  author  = {Alexander Meduna and Tomáš Kopeček},
  title   = {Simple-Semi-Conditional Versions of Matrix Grammars with a Reduced Regulating Mechanism},
  journal = {Computing and Informatics},
  volume  = {23},
  number  = {3},
  pages   = {287--302},
  year    = {2004},
  issn    = {1335-9150},
  url     = {https://cai.type.sk/content/2004/3/simple-semi-conditional-versions-of-matrix-grammars-with-a-reduced-regulating-mechanism/}
}
Download .bib