Conference paper

ZEMEK Petr. On the Nonterminal Complexity of Left Random Context E0L Grammars. In: Proceedings of the 17th Conference STUDENT EEICT 2011 Volume 3. Brno: Faculty of Information Technology BUT, 2011, pp. 510-514. ISBN 978-80-214-4273-3. Available from: http://www.feec.vutbr.cz/EEICT/2011/sbornik/03-Doktorske%20projekty/08-Informacni%20systemy/11-xzemek02.pdf
Publication language:english
Original title:On the Nonterminal Complexity of Left Random Context E0L Grammars
Title (cs):O neterminální složitosti levých E0L gramatik s nahodilým kontextem
Pages:510-514
Proceedings:Proceedings of the 17th Conference STUDENT EEICT 2011 Volume 3
Conference:Student EEICT 2011
Place:Brno, CZ
Year:2011
URL:http://www.feec.vutbr.cz/EEICT/2011/sbornik/03-Doktorske%20projekty/08-Informacni%20systemy/11-xzemek02.pdf
ISBN:978-80-214-4273-3
Publisher:Faculty of Information Technology BUT
Keywords
Formal languages, left random context E0L grammars, nonterminal complexity
Annotation
The present paper studies the nonterminal complexity of left random context E0L grammars. More specifically, it proves that every recursively enumerable language can be generated by a left random context E0L grammar with nine nonterminals. In the conclusion, some open problems related to the achieved result are stated.
BibTeX:
@INPROCEEDINGS{
   author = {Petr Zemek},
   title = {On the Nonterminal Complexity of Left Random Context E0L
	Grammars},
   pages = {510--514},
   booktitle = {Proceedings of the 17th Conference STUDENT EEICT 2011 Volume
	3},
   year = {2011},
   location = {Brno, CZ},
   publisher = {Faculty of Information Technology BUT},
   ISBN = {978-80-214-4273-3},
   language = {english},
   url = {http://www.fit.vutbr.cz/research/view_pub.php.en.iso-8859-2?id=9593}
}

Your IPv4 address: 54.162.105.241
Switch to IPv6 connection

DNSSEC [dnssec]