Publication result detail

Regulated Pushdown Automata Revisited

RYCHNOVSKÝ, L.

Original Title

Regulated Pushdown Automata Revisited

English Title

Regulated Pushdown Automata Revisited

Type

Paper in proceedings outside WoS and Scopus

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.

English 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

Key words in English

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

Authors

RYCHNOVSKÝ, L.

RIV year

2010

Released

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