Přístupnostní navigace
E-přihláška
Vyhledávání Vyhledat Zavřít
Detail publikačního výsledku
LUKÁŠ, R.; MEDUNA, A.
Originální název
Multigenerative Grammar Systems and Matrix Grammars
Anglický název
Druh
Článek Scopus
Originální abstrakt
Multigenerative grammar systems are based on cooperating context-free grammatical components that simultaneously generate their strings in a rule-controlled or nonterminal-controlled rewriting way, and after this simultaneous generation is completed, all the generated terminal strings are combined together by some common string operations, such as concatenation, and placed into the generated languages of these systems. The present paper proves that these systems are equivalent with the matrix grammars. In addition, we demonstrate that these systems with any number of grammatical components can be transformed to equivalent two-component versions of these systems. The paper points out that if these systems work in the leftmost rewriting way, they are more powerful than the systems working in a general way.
Anglický abstrakt
Klíčová slova
multigenerative grammar systems; simultaneously controlled derivations; matrix grammars
Klíčová slova v angličtině
Autoři
Rok RIV
2011
Vydáno
20.12.2010
ISSN
0023-5954
Periodikum
KYBERNETIKA
Svazek
46
Číslo
1
Stát
Česká republika
Strany od
68
Strany do
82
Strany počet
15
URL
http://www.dml.cz/bitstream/handle/10338.dmlcz/140054/Kybernetika_46-2010-1_5.pdf
BibTex
@article{BUT50887, author="Roman {Lukáš} and Alexandr {Meduna}", title="Multigenerative Grammar Systems and Matrix Grammars", journal="KYBERNETIKA", year="2010", volume="46", number="1", pages="68--82", issn="0023-5954", url="http://www.dml.cz/bitstream/handle/10338.dmlcz/140054/Kybernetika_46-2010-1_5.pdf" }