Prof. RNDr. Alexander Meduna, CSc.

MEDUNA Alexander a RYCHNOVSKÝ Lukáš. Infinite Language Hierarchy Based on Regular-Regulated Right-Linear Grammars with Start Strings. Philippine Computing Journal. Manila: 2008, roč. 2008, č. 3, s. 1-5. ISSN 1908-1995.
Jazyk publikace:čeština
Název publikace:Infinite Language Hierarchy Based on Regular-Regulated Right-Linear Grammars with Start Strings
Název (en):Philippine Computing Journal
Strany:1-5
Kniha:Philippine Computing Journal
Místo vydání:Manila, PH
Rok:2008
Časopis:Philippine Computing Journal, roč. 2008, č. 3, Manila, PH
ISSN:1908-1995
URL:http://www.philjol.info/index.php/PCJ [TEXT]
Klíčová slova
right-linear grammars, regular regulation, infinite hierarchy
of language families
Anotace
V článku jsou diskutovány pravě lineární gramatiky regulované regulárními gramatikami se startovacími řetězci a jejich generativní síla v případě dalších omezení.
Abstrakt
The present paper discusses regular-regulated right-linear
grammars with start strings rather than single symbols. It
demonstrates that these grammars with start strings consisting of no more than n + 1 symbols are stronger than these
grammars with start strings consisting of no more than n
symbols, for all n >= 1. On the other hand, these grammars
with start strings of any length only generate the family of
regular languages if they change the position of rewriting
finitely many times during the derivation of any sentence
from the generated language.
BibTeX:
@ARTICLE{
   author = {Alexander Meduna and Luk{\'{a}}{\v{s}}
	Rychnovsk{\'{y}}},
   title = {Infinite Language Hierarchy Based on
	Regular-Regulated Right-Linear Grammars with Start
	Strings},
   pages = {1--5},
   booktitle = {Philippine Computing Journal},
   journal = {Philippine Computing Journal},
   volume = 2008,
 number = 3,
   year = 2008,
   location = {Manila, PH},
   ISSN = {1908-1995},
   language = {czech},
   url = {http://www.fit.vutbr.cz/research/view_pub.php.cs?id=9004}
}

Vaše IPv4 adresa: 3.226.251.81
Přepnout na https