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

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26230%2F14%3APU111906" target="_blank" >RIV/00216305:26230/14:PU111906 - isvavai.cz</a>
Result on the web
<a href="http://www.sciencedirect.com/science/article/pii/S030439751300827X" target="_blank" >http://www.sciencedirect.com/science/article/pii/S030439751300827X</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1016/j.tcs.2013.11.009" target="_blank" >10.1016/j.tcs.2013.11.009</a>

Result language
angličtina
Original language name
One-Sided Random Context Grammars with a Limited Number of Right Random Context Rules
Original language description
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.
Czech name
—
Czech description
—

Type
J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database
CEP classification
—
OECD FORD branch
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Project
Result was created during the realization of more than one project. More information in the Projects tab.
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>Z - Vyzkumny zamer (s odkazem do CEZ)<br>S - Specificky vyzkum na vysokych skolach

Publication year
2014
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)