Publication Details

Generation of Languages by Rewriting Systems that Resemble Automata

KŘIVKA Zbyněk, MEDUNA Alexander and SCHÖNECKER Rudolf. Generation of Languages by Rewriting Systems that Resemble Automata. International Journal of Foundations of Computer Science, vol. 17, no. 5, 2006, pp. 1223-1229. ISSN 0129-0541.

Czech title

Generování jazyků přepisujícími systémy podobající se automatům

Type

journal article

Language

english

Authors

Křivka Zbyněk, Ing., Ph.D. (DIFS FIT BUT)
Meduna Alexander, prof. RNDr., CSc. (DIFS FIT BUT)
Schönecker Rudolf, Ing. (DIFS FIT BUT)

URL

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

Keywords

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

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.

Published

2006

Pages

1223-1229

Journal

International Journal of Foundations of Computer Science, vol. 17, no. 5, ISSN 0129-0541

Book

International Journal of Foundations of Computer Science

BibTeX

@ARTICLE{FITPUB8129,
   author = "Zbyn\v{e}k K\v{r}ivka and Alexander Meduna and Rudolf Sch{\"{o}}necker",
   title = "Generation of Languages by Rewriting Systems that Resemble Automata",
   pages = "1223--1229",
   booktitle = "International Journal of Foundations of Computer Science",
   journal = "International Journal of Foundations of Computer Science",
   volume = 17,
   number = 5,
   year = 2006,
   ISSN = "0129-0541",
   language = "english",
   url = "https://www.fit.vut.cz/research/publication/8129"
}