Detail publikačního výsledku

One-Sided Random Context Grammars with a Limited Number of Right Random Context Rules

MEDUNA, A.; ZEMEK, P.

Originální název

One-Sided Random Context Grammars with a Limited Number of Right Random Context Rules

Anglický název

One-Sided Random Context Grammars with a Limited Number of Right Random Context Rules

Druh

Článek WoS

Originální abstrakt

This paper deals with regulated grammars. Specifically, it studies one-sided random context grammars. It demonstrates that any recursively enumerable language can be generated by these grammars with no more than two right random context rules.

Anglický abstrakt

This paper deals with regulated grammars. Specifically, it studies one-sided random context grammars. It demonstrates that any recursively enumerable language can be generated by these grammars with no more than two right random context rules.

Klíčová slova

formal languages, one-sided random context grammars, right random context rules, reduction

Klíčová slova v angličtině

formal languages, one-sided random context grammars, right random context rules, reduction

Autoři

MEDUNA, A.; ZEMEK, P.

Rok RIV

2015

Vydáno

09.01.2014

ISSN

0304-3975

Periodikum

Theoretical Computer Science

Svazek

516

Číslo

1

Stát

Nizozemsko

Strany od

127

Strany do

132

Strany počet

6

URL

http://www.sciencedirect.com/science/article/pii/S030439751300827X

BibTex

@article{BUT111481,
  author="Alexandr {Meduna} and Petr {Zemek}",
  title="One-Sided Random Context Grammars with a Limited Number of Right Random Context Rules",
  journal="Theoretical Computer Science",
  year="2014",
  volume="516",
  number="1",
  pages="127--132",
  doi="10.1016/j.tcs.2013.11.009",
  issn="0304-3975",
  url="http://www.sciencedirect.com/science/article/pii/S030439751300827X"
}