Journal article

MEDUNA Alexander and ZEMEK Petr. Controlled Pure Grammar Systems. Journal of Universal Computer Science. 2012, vol. 18, no. 14, pp. 2024-2040. ISSN 0948-6968. Available from:
Publication language:english
Original title:Controlled Pure Grammar Systems
Title (cs):Řízené čisté gramatické systémy
Journal:Journal of Universal Computer Science, Vol. 18, No. 14, AT
formal languages, pure grammar systems, controlled derivations
This paper discusses grammar systems that have only terminals, work in the leftmost way, and generate their languages under the regulation by control languages over rule labels. It establishes three results concerning their generative power. First, without any control languages, these systems are not even able to generate all context-free languages. Second, with regular control languages, these systems, having no more than two components, characterize the family of recursively enumerable languages. Finally, with control languages that are themselves generated by regular-controlled context-free grammars, these systems over unary alphabets generate nothing but regular languages. In its introductory section, the paper gives a motivation for introducing these systems, and in the concluding section, it formulates several open problems.
   author = {Alexander Meduna and Petr Zemek},
   title = {Controlled Pure Grammar Systems},
   pages = {2024--2040},
   journal = {Journal of Universal Computer Science},
   volume = {18},
   number = {14},
   year = {2012},
   ISSN = {0948-6968},
   language = {english},
   url = {}

Your IPv4 address:
Switch to IPv6 connection

DNSSEC [dnssec]