Publication Details

Regulated Pushdown Automata Revisited

RYCHNOVSKÝ Lukáš. Regulated Pushdown Automata Revisited. In: Proceedings of the 15th Conference STUDENT EEICT 2009. Brno: Faculty of Information Technology BUT, 2009, pp. 440-444. ISBN 978-80-214-3870-5.

Czech title

Nový pohled na řízené zásobníkové automaty

Type

conference paper

Language

english

Authors

Rychnovský Lukáš, Ing. (DIFS FIT BUT)

Keywords

regulated pushdown automata, recursive enumerable languages, direct and constructive proof

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.

Published

2009

Pages

440-444

Proceedings

Proceedings of the 15th Conference STUDENT EEICT 2009

Conference

Student EEICT 2009, Brno, CZ

ISBN

978-80-214-3870-5

Publisher

Faculty of Information Technology BUT

Place

Brno, CZ

BibTeX

@INPROCEEDINGS{FITPUB9142,
   author = "Luk\'{a}\v{s} Rychnovsk\'{y}",
   title = "Regulated Pushdown Automata Revisited",
   pages = "440--444",
   booktitle = "Proceedings of the 15th Conference STUDENT EEICT 2009",
   year = 2009,
   location = "Brno, CZ",
   publisher = "Faculty of Information Technology BUT",
   ISBN = "978-80-214-3870-5",
   language = "english",
   url = "https://www.fit.vut.cz/research/publication/9142"
}