Publication detail

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

KOPEČEK, T., MEDUNA, A.

Original Title

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

Type

journal article - other

Language

English

Original 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

descriptional complexity, matrix grammars, simple-semi-conditional grammars

Authors

KOPEČEK, T., MEDUNA, A.

RIV year

2004

Released

19. 10. 2004

ISBN

1335-9150

Periodical

Computing and Informatics

Year of study

2004

Number

23

State

Slovak Republic

Pages from

287

Pages to

302

Pages count

16

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"
}