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

Authors

  • Alexander Meduna
  • Tomáš Kopeček

Keywords:

Descriptional complexity, matrix grammars, simple semi-conditional grammars

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.

Downloads

Download data is not yet available.

Downloads

Published

2012-02-20

How to Cite

Meduna, A., & Kopeček, T. (2012). Simple-Semi-Conditional Versions of Matrix Grammars with a Reduced Regulating Mechanism. Computing and Informatics, 23(3), 287–302. Retrieved from http://147.213.75.17/ojs/index.php/cai/article/view/430