Detail publikace

Generation of Languages by Rewriting Systems that Resemble Automata

KŘIVKA, Z. MEDUNA, A. SCHÖNECKER, R.

Originální název

Generation of Languages by Rewriting Systems that Resemble Automata

Typ

článek v časopise - ostatní, Jost

Jazyk

angličtina

Originální abstrakt

This paper  introduces and discusses #-Rewriting Systems, which represent language-generating devices that resemble automata by using finitely many states without any nonterminals.  It demonstrates that these systems characterize the well-known infinite hierarchy of language families resulting from programmed grammars of finite index in a very natural way.  In its conclusion, this paper suggests some variants of #-Rewriting Systems.

Klíčová slova

#-rewriting systems; programmed grammars; infinite hierarchy; finite index

Autoři

KŘIVKA, Z.; MEDUNA, A.; SCHÖNECKER, R.

Rok RIV

2006

Vydáno

31. 7. 2006

ISSN

0129-0541

Periodikum

International Journal of Foundations of Computer Science

Ročník

17

Číslo

5

Stát

Singapurská republika

Strany od

1223

Strany do

1229

Strany počet

7

URL

http://www.worldscinet.com/journals/ijfcs/17/1705/S0129054106004352.html

BibTex

@article{BUT45080,
  author="Zbyněk {Křivka} and Alexandr {Meduna} and Rudolf {Schönecker}",
  title="Generation of Languages by Rewriting Systems that Resemble Automata",
  journal="International Journal of Foundations of Computer Science",
  year="2006",
  volume="17",
  number="5",
  pages="1223--1229",
  issn="0129-0541",
  url="http://www.worldscinet.com/journals/ijfcs/17/1705/S0129054106004352.html"
}