Publication Details

On k#$-Rewriting Systems

KŘIVKA Zbyněk, KUČERA Jiří and MEDUNA Alexander. On k#$-Rewriting Systems. Romanian Journal of Information Science and Technology (ROMJIST), vol. 21, no. 3, 2018, pp. 278-287. ISSN 1453-8245. Available from: http://www.romjist.ro/full-texts/paper600.pdf
Czech title
O k#$-přepisujících systémech
Type
journal article
Language
english
Authors
Křivka Zbyněk, Ing., Ph.D. (DIFS FIT BUT)
Kučera Jiří, Ing., Ph.D. (DIFS FIT BUT)
Meduna Alexander, prof. RNDr., CSc. (DIFS FIT BUT)
URL
Keywords

k#$-rewriting systems, pushdown, #-rewriting systems, infinite hierarchy, nite index, n-limited state grammars

Abstract

This paper introduces k#$-rewriting systems based on earlier defined #-rewriting systems but with additional pushdown memory. It demonstrates that these systems characterize an infinite hierarchy of language families resulting from the limited number of rewriting positions in every configuration during the generation of a sentence.

Published
2018
Pages
278-287
Journal
Romanian Journal of Information Science and Technology (ROMJIST), vol. 21, no. 3, ISSN 1453-8245
Publisher
Romanian Academy, Publishing House of the Romanian Academy
UT WoS
000455900300009
EID Scopus
2-s2.0-85056666890
BibTeX 
@ARTICLE{FITPUB11553,
   author = "Zbyn\v{e}k K\v{r}ivka and Ji\v{r}\'{i} Ku\v{c}era and Alexander Meduna",
   title = "On k\#\$-Rewriting Systems",
   pages = "278--287",
   journal = "Romanian Journal of Information Science and Technology (ROMJIST)",
   volume = 21,
   number = 3,
   year = 2018,
   ISSN = "1453-8245",
   language = "english",
   url = "https://www.fit.vut.cz/research/publication/11553"
}
Back to top