Prof. RNDr. Alexander Meduna, CSc.

MEDUNA Alexander a ŠVEC Martin. Forbidding ET0L Systems. Theoretical Computer Science. Paris: Elsevier Science, 2003, roč. 2003, č. 306, s. 449-469. ISSN 0304-3975.
Jazyk publikace:angličtina
Název publikace:Forbidding ET0L Systems
Název (cs):Zakazující EOL systémy
Strany:449-469
Kniha:Theoretical Computer Science
Místo vydání:Paris, FR
Rok:2003
Časopis:Theoretical Computer Science, roč. 2003, č. 306, Paris, FR
ISSN:0304-3975
Vydavatel:Elsevier Science
Klíčová slova
Zakazující EOL systémy
Anotace
Zakazující EOL systémy jsou zkoumány.
Abstrakt
The present paper introduces and discusses forbidding ET0L grammars whose productions have some attached strings, called forbidding conditions. These grammars can make a derivation step only by using productions whose forbidding conditions do not appear in the rewritten sentential form. The paper demonstrates that some well-known relationships concerning the language families resulting from ordinary ET0L grammars do not hold in terms of the forbidding ET0L grammars. Most interestingly, while E0L grammars are less powerful than ET0L grammars, their forbidding versions with conditions of length one are equally powerful. On the other hand, while EP0L grammars are as powerful as E0L grammars, FEP0L grammars are less powerful than FE0L grammars.
BibTeX:
@ARTICLE{
   author = {Alexander Meduna and Martin {\v{S}}vec},
   title = {Forbidding ET0L Systems},
   pages = {449--469},
   booktitle = {Theoretical Computer Science},
   journal = {Theoretical Computer Science},
   volume = 2003,
 number = 306,
   year = 2003,
   location = {Paris, FR},
   publisher = {Elsevier Science},
   ISSN = {0304-3975},
   language = {english},
   url = {http://www.fit.vutbr.cz/research/view_pub.php.cs?id=7141}
}

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