Detail výsledku

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.
Typ
článek v časopise
Jazyk
anglicky
Autoři
Křivka Zbyněk, Ing., Ph.D., FIT (FIT), UIFS (FIT)
Meduna Alexandr, prof. RNDr., CSc., UIFS (FIT)
Schönecker Rudolf, Ing., FIT (FIT), UIFS (FIT)
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

URL
Rok
2006
Strany
1223–1229
Časopis
INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, roč. 17, č. 5, ISSN 0129-0541
Kniha
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"
}
Projekty
Optimally Integrated Models of Modern Information Technologies, GAČR, Standardní projekty, GA201/04/0441, zahájení: 2004-01-01, ukončení: 2006-12-31, ukončen
Výzkumné skupiny
Výzkumná skupina formálních modelů (VZ FM)
Pracoviště
Ústav informačních systémů (UIFS)
Nahoru