Result Details

Generation of Languages by Rewriting Systems that Resemble Automata

KŘIVKA, Z.; MEDUNA, A.; SCHÖNECKER, R. Generation of Languages by Rewriting Systems that Resemble Automata. INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2006, vol. 17, no. 5, p. 1223-1229. ISSN: 0129-0541.
Type
journal article
Language
English
Authors
Křivka Zbyněk, Ing., Ph.D., DIFS (FIT)
Meduna Alexandr, prof. RNDr., CSc., DIFS (FIT)
Schönecker Rudolf, Ing., DIFS (FIT)
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

URL
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{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"
}
Projects
Optimally Integrated Models of Modern Information Technologies, GACR, Standardní projekty, GA201/04/0441, start: 2004-01-01, end: 2006-12-31, completed
Research groups
Formal Model Research Group (RG FM)
Departments
Department of Information Systems (DIFS)
Back to top