Publication result detail

On k#$-Rewriting Systems

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

Original Title

On k#$-Rewriting Systems

English Title

On k#$-Rewriting Systems

Type

WoS Article

Original 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.

English 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.

Keywords

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

Key words in English

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

Authors

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

RIV year

2019

Released

26.10.2018

ISBN

1453-8245

Periodical

Romanian Journal of Information Science and Technology

Volume

21

Number

3

State

Romania

Pages from

278

Pages to

287

Pages count

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"
}

Documents

paper
paper_romjist_kg_submitted