Detail publikačního výsledku

How to Generate Recursively Enumerable Languages Using Only Context-free Productions and Eight Nonterminals

BIDLO, R.; BLATNÝ, P.

Originální název

How to Generate Recursively Enumerable Languages Using Only Context-free Productions and Eight Nonterminals

Anglický název

How to Generate Recursively Enumerable Languages Using Only Context-free Productions and Eight Nonterminals

Druh

Stať ve sborníku mimo WoS a Scopus

Originální abstrakt

The notion of a context-free grammar over a free group is introduced.The transformation of any type-0 grammar to an equivalent context-freegrammar over a free group is demonstrated. This approach causes anundesirable increase of the number of nonterminal symbols. Hence weintroduce a method for their reduction.

Anglický abstrakt

The notion of a context-free grammar over a free group is introduced.The transformation of any type-0 grammar to an equivalent context-freegrammar over a free group is demonstrated. This approach causes anundesirable increase of the number of nonterminal symbols. Hence weintroduce a method for their reduction.

Klíčová slova

Context-Free Grammars, Derivations, Free Groups, Recursively Enumerable Languages

Klíčová slova v angličtině

Context-Free Grammars, Derivations, Free Groups, Recursively Enumerable Languages

Autoři

BIDLO, R.; BLATNÝ, P.

Rok RIV

2011

Vydáno

13.05.2005

Nakladatel

Faculty of Electrical Engineering and Communication BUT

Místo

Brno

ISBN

80-214-2890-2

Kniha

Proceedings of 11th Conference and Competition Student EEICT 2005, Volume 3

Strany od

536

Strany do

541

Strany počet

6

BibTex

@inproceedings{BUT18908,
  author="Radek {Bidlo} and Petr {Blatný}",
  title="How to Generate Recursively Enumerable Languages Using Only Context-free Productions and Eight Nonterminals",
  booktitle="Proceedings of 11th Conference and Competition Student EEICT 2005, Volume 3",
  year="2005",
  pages="536--541",
  publisher="Faculty of Electrical Engineering and Communication BUT",
  address="Brno",
  isbn="80-214-2890-2"
}