Detail výsledku

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.
Typ
článek v časopise
Jazyk
anglicky
Autoři
Kopeček Tomáš, Ing., Ph.D., UIFS (FIT)
Meduna Alexandr, prof. RNDr., CSc., UIFS (FIT)
Abstrakt

This paper discusses some conditional versions of matrix grammars. Itestablishes several characterizations of the family of the recursivelyenumerable languages based on these grammars. In fact, making use ofthe Geffert Normal forms, the present paper demonstrates thesecharacterizations based on matrix grammars with conditions of a limitedlength, a reduced number of nonterminals, and a reduced number and sizeof matrices.

Klíčová slova

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

Rok
2004
Strany
287–302
Časopis
COMPUTING AND INFORMATICS, roč. 2004, č. 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"
}
Projekty
Optimally Integrated Models of Modern Information Technologies, GAČR, Standardní projekty, GA201/04/0441, zahájení: 2004-01-01, ukončení: 2006-12-31, ukončen
Pracoviště
Ústav informačních systémů (UIFS)
Nahoru