Detail publikace

Jumping Grammars

Originální název

Jumping Grammars

Anglický název

Jumping Grammars

Jazyk

en

Originální abstrakt

This paper introduces and studies jumping grammars, which represent a grammatical counterpart to the recently introduced jumping automata. These grammars are conceptualized just like classical grammars except that during the applications of their productions, they can jump over symbols in either direction within the rewritten strings. More precisely, a jumping grammar rewrites a string z according to a rule x -> y in such a way that it selects an occurrence of x in z, erases it, and inserts y anywhere in the rewritten string, so this insertion may occur at a different position than the erasure of x. The paper concentrates its attention on investigating the generative power of jumping grammars. More specifically, it compares this power with that of jumping automata and that of classical grammars.  A special attention is paid to various context-free versions of jumping grammars, such as regular, right-linear, linear, and context-free grammars of finite index. In addition, we study the semilinearity of context-free, context-sensitive, and monotonous jumping grammars. We also demonstrate that the general versions of jumping grammars characterize the family of recursively enumerable languages. In its conclusion, the paper formulates several open problems and suggests future investigation areas.

Anglický abstrakt

This paper introduces and studies jumping grammars, which represent a grammatical counterpart to the recently introduced jumping automata. These grammars are conceptualized just like classical grammars except that during the applications of their productions, they can jump over symbols in either direction within the rewritten strings. More precisely, a jumping grammar rewrites a string z according to a rule x -> y in such a way that it selects an occurrence of x in z, erases it, and inserts y anywhere in the rewritten string, so this insertion may occur at a different position than the erasure of x. The paper concentrates its attention on investigating the generative power of jumping grammars. More specifically, it compares this power with that of jumping automata and that of classical grammars.  A special attention is paid to various context-free versions of jumping grammars, such as regular, right-linear, linear, and context-free grammars of finite index. In addition, we study the semilinearity of context-free, context-sensitive, and monotonous jumping grammars. We also demonstrate that the general versions of jumping grammars characterize the family of recursively enumerable languages. In its conclusion, the paper formulates several open problems and suggests future investigation areas.

BibTex


@article{BUT119793,
  author="Zbyněk {Křivka} and Alexandr {Meduna}",
  title="Jumping Grammars",
  annote="This paper introduces and studies jumping grammars, which represent a grammatical
counterpart to the recently introduced jumping automata. These grammars are
conceptualized just like classical grammars except that during the applications
of their productions, they can jump over symbols in either direction within the
rewritten strings. More precisely, a jumping grammar rewrites a string z
according to a rule x -> y in such a way that it selects an occurrence of x in z,
erases it, and inserts y anywhere in the rewritten string, so this insertion may
occur at a different position than the erasure of x. 

The paper concentrates its attention on investigating the generative power of
jumping grammars. More specifically, it compares this power with that of jumping
automata and that of classical grammars.  A special attention is paid to various
context-free versions of jumping grammars, such as regular, right-linear, linear,
and context-free grammars of finite index. In addition, we study the
semilinearity of context-free, context-sensitive, and monotonous jumping
grammars. We also demonstrate that the general versions of jumping grammars
characterize the family of recursively enumerable languages. In its conclusion,
the paper formulates several open problems and suggests future investigation
areas.",
  address="NEUVEDEN",
  chapter="119793",
  doi="10.1142/S0129054115500409",
  edition="NEUVEDEN",
  howpublished="print",
  institution="NEUVEDEN",
  number="6",
  volume="26",
  year="2015",
  month="october",
  pages="709--731",
  publisher="NEUVEDEN",
  type="journal article in Web of Science"
}