Detail publikace

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

KOPEČEK, T., MEDUNA, A.

Originální název

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

Typ

článek v časopise - ostatní, Jost

Jazyk

angličtina

Originální abstrakt

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.

Klíčová slova

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

Autoři

KOPEČEK, T., MEDUNA, A.

Rok RIV

2004

Vydáno

19. 10. 2004

ISSN

1335-9150

Periodikum

Computing and Informatics

Ročník

2004

Číslo

23

Stát

Slovenská republika

Strany od

287

Strany do

302

Strany počet

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