Detail publikačního výsledku

Jumping Pure Grammars

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

Originální název

Jumping Pure Grammars

Anglický název

Jumping Pure Grammars

Druh

Článek WoS

Originální abstrakt

This paper introduces and studies jumping pure grammars, which are conceptualized just like classical pure grammars except that during the applications of their productions, they can jump over symbols in either direction within the rewritten strings. The paper compares the generative power of jumping pure grammars with that of classical pure grammars while distinguishing between their versions with and without erasing productions. Apart from sequential versions, the paper makes an analogical study in terms of parallel versions of jumping pure grammars represented by 0L grammars.

Anglický abstrakt

This paper introduces and studies jumping pure grammars, which are conceptualized just like classical pure grammars except that during the applications of their productions, they can jump over symbols in either direction within the rewritten strings. The paper compares the generative power of jumping pure grammars with that of classical pure grammars while distinguishing between their versions with and without erasing productions. Apart from sequential versions, the paper makes an analogical study in terms of parallel versions of jumping pure grammars represented by 0L grammars.

Klíčová slova

jumping grammars, pure grammars, jumping rewriting, 0L languages, parallel rewriting, pure context-free languages

Klíčová slova v angličtině

jumping grammars, pure grammars, jumping rewriting, 0L languages, parallel rewriting, pure context-free languages

Autoři

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

Rok RIV

2019

Vydáno

31.01.2019

ISSN

0010-4620

Periodikum

COMPUTER JOURNAL

Svazek

62

Číslo

1

Stát

Spojené království Velké Británie a Severního Irska

Strany od

30

Strany do

41

Strany počet

12

URL

BibTex

@article{BUT155634,
  author="Alexandr {Meduna} and Zbyněk {Křivka} and Jiří {Kučera}",
  title="Jumping Pure Grammars",
  journal="COMPUTER JOURNAL",
  year="2019",
  volume="62",
  number="1",
  pages="30--41",
  doi="10.1093/comjnl/bxy027",
  issn="0010-4620",
  url="https://doi.org/10.1093/comjnl/bxy027"
}

Dokumenty