Přístupnostní navigace
E-application
Search Search Close
Publication detail
RYCHNOVSKÝ, L.
Original Title
Regulated Pushdown Automata Revisited
Type
article in a collection out of WoS and Scopus
Language
English
Original Abstract
This article demonstrates alternative proof of well-known theorem of equivalence between regulated pushdown automata and recursive enumerable languages as shown in Meduna, A., Kolář D.: Regulated Pushdown Automata, Acta Cybernetica, Vol. 14, 2000. Pages 653-664.
Keywords
regulated pushdown automata, recursive enumerable languages, direct and constructive proof
Authors
RIV year
2009
Released
23. 4. 2009
Publisher
Faculty of Information Technology BUT
Location
Brno
ISBN
978-80-214-3870-5
Book
Proceedings of the 15th Conference STUDENT EEICT 2009
Pages from
440
Pages to
444
Pages count
5
BibTex
@inproceedings{BUT30862, author="Lukáš {Rychnovský}", title="Regulated Pushdown Automata Revisited", booktitle="Proceedings of the 15th Conference STUDENT EEICT 2009", year="2009", pages="440--444", publisher="Faculty of Information Technology BUT", address="Brno", isbn="978-80-214-3870-5" }