Publication detail

Generation of Languages by Rewriting Systems that Resemble Automata

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

Original Title

Generation of Languages by Rewriting Systems that Resemble Automata

Type

journal article - other

Language

English

Original Abstract

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.

Keywords

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

Authors

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

RIV year

2006

Released

31. 7. 2006

ISBN

0129-0541

Periodical

International Journal of Foundations of Computer Science

Year of study

17

Number

5

State

Republic of Singapore

Pages from

1223

Pages to

1229

Pages count

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"
}