Publication Details

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

KOPEČEK, T.; MEDUNA, A. Simple-Semi-Conditional Versions of Matrix Grammars with a Reduced Regulating Mechanism. Computing and Informatics, 2004, vol. 2004, no. 23, p. 287-302. ISSN: 1335-9150.

Czech title

Jednoduché polopodmínkové verze maticových gramatik s omezeným regulačním mechanizmem

Type

journal article

Language

English

Authors

Kopeček Tomáš, Ing., Ph.D.
Meduna Alexandr, prof. RNDr., CSc. (DIFS)

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.

Published

2004

Pages

287–302

Journal

Computing and Informatics, vol. 2004, no. 23, ISSN 1335-9150

BibTeX

@article{BUT45745,
  author="Tomáš {Kopeček} and Alexandr {Meduna}",
  title="Simple-Semi-Conditional Versions of Matrix Grammars with a Reduced Regulating Mechanism",
  journal="Computing and Informatics",
  year="2004",
  volume="2004",
  number="23",
  pages="287--302",
  issn="1335-9150"
}