Detail publikačního výsledku

On k#$-Rewriting Systems

KUČERA, J.; KŘIVKA, Z.; MEDUNA, A.

Originální název

On k#$-Rewriting Systems

Anglický název

On k#$-Rewriting Systems

Druh

Článek WoS

Originální abstrakt

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.

Anglický abstrakt

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.

Klíčová slova

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

Klíčová slova v angličtině

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

Autoři

KUČERA, J.; KŘIVKA, Z.; MEDUNA, A.

Rok RIV

2019

Vydáno

26.10.2018

ISSN

1453-8245

Periodikum

Romanian Journal of Information Science and Technology

Svazek

21

Číslo

3

Stát

Rumunsko

Strany od

278

Strany do

287

Strany počet

10

URL

http://www.romjist.ro/full-texts/paper600.pdf

BibTex

@article{BUT154997,
  author="Jiří {Kučera} and Zbyněk {Křivka} and Alexandr {Meduna}",
  title="On k#$-Rewriting Systems",
  journal="Romanian Journal of Information Science and Technology",
  year="2018",
  volume="21",
  number="3",
  pages="278--287",
  issn="1453-8245",
  url="http://www.romjist.ro/full-texts/paper600.pdf"
}

Dokumenty

paper
paper_romjist_kg_submitted