Detail výsledku

Combined Leftmost Derivations in Matrix Grammars

MEDUNA, A.; ŠKRKAL, O. Combined Leftmost Derivations in Matrix Grammars. Proceedings of 7th International Conference ISIM'04 Information Systems Implementation and Modelling. 1st edition. Ostrava: Marq software s.r.o., 2004. p. 127-132. ISBN: 80-85988-99-2.
Typ
článek ve sborníku konference
Jazyk
anglicky
Autoři
Meduna Alexandr, prof. RNDr., CSc., UIFS (FIT)
Škrkal Oto, Ing., UIFS (FIT)
Abstrakt

It is an open problem, whether matrix grammars with erasing productions using leftmost derivation of type three generate the whole family of recursively enumerable languages. This paper proves that matrix grammars that apply one matrix using leftmost derivation of type one and all other matrices using leftmost derivation of type three generate the family of recursively enumerable languages.

Klíčová slova

Formal language theory, regulated rewriting, matrix grammar, canonical derivation, generative power.

Rok
2004
Strany
127–132
Sborník
Proceedings of 7th International Conference ISIM'04 Information Systems Implementation and Modelling
Řada
1st edition
Konference
7th International Conference on Information Systems Implementation and Modelling
ISBN
80-85988-99-2
Vydavatel
Marq software s.r.o.
Místo
Ostrava
BibTeX 
@inproceedings{BUT17119,
  author="Alexandr {Meduna} and Oto {Škrkal}",
  title="Combined Leftmost Derivations in Matrix Grammars",
  booktitle="Proceedings of 7th International Conference ISIM'04 Information Systems Implementation and Modelling",
  year="2004",
  series="1st edition",
  pages="127--132",
  publisher="Marq software s.r.o.",
  address="Ostrava",
  isbn="80-85988-99-2"
}
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