Journal article

MEDUNA Alexander and ZEMEK Petr. One-Sided Random Context Grammars with a Limited Number of Right Random Context Rules. Theoretical Computer Science. Paris: Elsevier Science, 2014, vol. 516, no. 1, pp. 127-132. ISSN 0304-3975. Available from: http://www.sciencedirect.com/science/article/pii/S030439751300827X
Publication language:english
Original title:One-Sided Random Context Grammars with a Limited Number of Right Random Context Rules
Title (cs):Jednostranné gramatiky s nahodilým kontextem a s omezeným počtem pravě kontextových pravidel
Pages:127-132
Place:FR
Year:2014
URL:http://www.sciencedirect.com/science/article/pii/S030439751300827X
Journal:Theoretical Computer Science, Vol. 516, No. 1, Paris, FR
ISSN:0304-3975
Keywords
formal languages, one-sided random context grammars, right random context rules, reduction
Annotation
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.
BibTeX:
@ARTICLE{
   author = {Alexander Meduna and Petr Zemek},
   title = {One-Sided Random Context Grammars with a Limited Number of
	Right Random Context Rules},
   pages = {127--132},
   journal = {Theoretical Computer Science},
   volume = {516},
   number = {1},
   year = {2014},
   ISSN = {0304-3975},
   language = {english},
   url = {http://www.fit.vutbr.cz/research/view_pub.php?id=10190}
}

Your IPv4 address: 54.158.224.206
Switch to IPv6 connection

DNSSEC [dnssec]