Detail publikačního výsledku

n-Right-Linear #-Rewriting Systems

KŘIVKA, Z.; MEDUNA, A.; SMRČEK, J.

Originální název

n-Right-Linear #-Rewriting Systems

Anglický název

n-Right-Linear #-Rewriting Systems

Druh

Stať ve sborníku mimo WoS a Scopus

Originální abstrakt

The present paper  discusses #-rewriting systems, which represent simple language-defining devices that combine both automata and grammars.  Indeed, like automata, they use finitely many states without any nonterminals; on the other hand, like grammars, they generate languages.  The paper introduces n-right-linear #-rewriting systems and characterize the infinite hierarchy of language families defined by m-parallel n-right-linear simple matrix grammars.  However, it also places some trivial restrictions on rewriting in these systems and demonstrates that under these restrictions, they generate only the family of right-linear languages. In its conclusion, this paper suggests some variants of #-rewriting systems.

Anglický abstrakt

The present paper  discusses #-rewriting systems, which represent simple language-defining devices that combine both automata and grammars.  Indeed, like automata, they use finitely many states without any nonterminals; on the other hand, like grammars, they generate languages.  The paper introduces n-right-linear #-rewriting systems and characterize the infinite hierarchy of language families defined by m-parallel n-right-linear simple matrix grammars.  However, it also places some trivial restrictions on rewriting in these systems and demonstrates that under these restrictions, they generate only the family of right-linear languages. In its conclusion, this paper suggests some variants of #-rewriting systems.

Klíčová slova

#-rewriting systems of finite index, right-linear #-rewriting systems, m-parallel n-right-linear simple matrix languages, infinite hierarchies of language families

Klíčová slova v angličtině

#-rewriting systems of finite index, right-linear #-rewriting systems, m-parallel n-right-linear simple matrix languages, infinite hierarchies of language families

Autoři

KŘIVKA, Z.; MEDUNA, A.; SMRČEK, J.

Vydáno

26.10.2007

Nakladatel

Ing. Zdeněk Novotný, CSc.

Místo

Znojmo

ISBN

978-80-7355-077-6

Kniha

Third Doctoral Workshop on Mathematical and Engineering Methods in Computer Science (MEMICS 2007)

Strany od

105

Strany do

112

Strany počet

8

URL

https://www.fit.vut.cz/research/publication/8498/

BibTex

@inproceedings{BUT25352,
  author="Zbyněk {Křivka} and Alexandr {Meduna} and Jaromír {Smrček}",
  title="n-Right-Linear #-Rewriting Systems",
  booktitle="Third Doctoral Workshop on Mathematical and Engineering Methods in Computer Science (MEMICS 2007)",
  year="2007",
  pages="105--112",
  publisher="Ing. Zdeněk Novotný, CSc.",
  address="Znojmo",
  isbn="978-80-7355-077-6",
  url="https://www.fit.vut.cz/research/publication/8498/"
}

Dokumenty

krivka_memics2007_cameraready
rlin_brs_v3
fit-memics07-presentation
fit-memics07