Conference paper

 
Bidlo, R., Blatný, P.: How to Generate Recursively Enumerable Languages Using Only Context-free Productions and Eight Nonterminals, In: Proceedings of 11th Conference and Competition Student EEICT 2005, Volume 3, Brno, CZ, FEKT VUT, 2005, p. 536-541, ISBN 80-214-2890-2
Publication language:english
Original title:How to Generate Recursively Enumerable Languages Using Only Context-free Productions and Eight Nonterminals
Title (cs):Jak generovat rekurzívně vyčíslitelné jazyky použitím pouze bezkontextových pravidel a osmi nonterminálů
Pages:536-541
Proceedings:Proceedings of 11th Conference and Competition Student EEICT 2005, Volume 3
Conference:STUDENT EEICT 2005
Place:Brno, CZ
Year:2005
ISBN:80-214-2890-2
Publisher:Faculty of Electrical Engineering and Communication BUT
Keywords
Context-Free Grammars, Derivations, Free Groups, Recursively Enumerable Languages
Annotation
The notion of a context-free grammar over a free group is introduced. The transformation of any type-0 grammar to an equivalent context-free grammar over a free group is demonstrated. This approach causes an undesirable increase of the number of nonterminal symbols. Hence we introduce a method for their reduction.
BibTeX:
@INPROCEEDINGS{
   author = {Radek Bidlo and Petr Blatný},
   title = {How to Generate Recursively Enumerable Languages Using Only
	Context-free Productions and Eight Nonterminals},
   pages = {536--541},
   booktitle = {Proceedings of 11th Conference and Competition Student EEICT
	2005, Volume 3},
   year = {2005},
   location = {Brno, CZ},
   publisher = {Faculty of Electrical Engineering and Communication BUT},
   ISBN = {80-214-2890-2},
   language = {english},
   url = {http://www.fit.vutbr.cz/research/view_pub.php?id=7772}
}