Detail výsledku

Multigenerative Grammar Systems

LUKÁŠ, R.; MEDUNA, A. Multigenerative Grammar Systems. Pre-proceedings 1st Doctoral Workshop on Mathematical and Engineering Methods in Comupter Science (MEMICS 2005). Brno: Faculty of Informatics MU, 2005. p. 85-87.
Typ
článek ve sborníku konference
Jazyk
anglicky
Autoři
Lukáš Roman, Ing., Ph.D., UIFS (FIT)
Meduna Alexandr, prof. RNDr., CSc., UIFS (FIT)
Abstrakt

This paper presents new models for all recursive enumerable languages. These models are based on a multigenerative grammar systems that simultaneously generate several strings in a parallel way. The components of these models are context-free grammars, working in a leftmost way. The rewritten nonterminals are determined by a finite set of nonterminal sequences.

Klíčová slova

Grammar system, context-free grammar, left-most derivation.

Rok
2005
Strany
85–87
Sborník
Pre-proceedings 1st Doctoral Workshop on Mathematical and Engineering Methods in Comupter Science (MEMICS 2005)
Konference
1st Doctoral Workshop on Mathematical and Engineering Methods in Computer Science -- MEMICS 2005
Vydavatel
Faculty of Informatics MU
Místo
Brno
BibTeX 
@inproceedings{BUT192583,
  author="Roman {Lukáš} and Alexandr {Meduna}",
  title="Multigenerative Grammar Systems",
  booktitle="Pre-proceedings 1st Doctoral Workshop on Mathematical and Engineering Methods in Comupter Science (MEMICS 2005)",
  year="2005",
  pages="85--87",
  publisher="Faculty of Informatics MU",
  address="Brno"
}
Pracoviště
Ústav informačních systémů (UIFS)
Nahoru