Journal article

KŘIVKA Zbyněk, KUČERA Jiří and MEDUNA Alexander. On k#$-Rewriting Systems. Romanian Journal of Information Science and Technology (ROMJIST). Bukurest: Romanian Academy, Publishing House of the Romanian Academy, 2018, vol. 21, no. 3, pp. 278-287. ISSN 1453-8245. Available from: http://www.romjist.ro/full-texts/paper600.pdf
Publication language:english
Original title:On k#$-Rewriting Systems
Title (cs):O k#$-přepisujících systémech
Pages:278-287
Place:RO
Year:2018
URL:http://www.romjist.ro/full-texts/paper600.pdf
Journal:Romanian Journal of Information Science and Technology (ROMJIST), Vol. 21, No. 3, Bukurest, RO
ISSN:1453-8245
Keywords
k#$-rewriting systems, pushdown, #-rewriting systems, infinite hierarchy, nite index, n-limited state grammars
Annotation
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.
BibTeX:
@ARTICLE{
   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 = {http://www.fit.vutbr.cz/research/view_pub.php.en.iso-8859-2?id=11553}
}

Your IPv4 address: 100.24.209.47