Detail publikace

Regulated Pushdown Automata Revisited

RYCHNOVSKÝ, L.

Originální název

Regulated Pushdown Automata Revisited

Typ

článek ve sborníku mimo WoS a Scopus

Jazyk

angličtina

Originální abstrakt

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.

Klíčová slova

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

Autoři

RYCHNOVSKÝ, L.

Rok RIV

2009

Vydáno

23. 4. 2009

Nakladatel

Faculty of Information Technology BUT

Místo

Brno

ISBN

978-80-214-3870-5

Kniha

Proceedings of the 15th Conference STUDENT EEICT 2009

Strany od

440

Strany do

444

Strany počet

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"
}