Result Details

Regulated Pushdown Automata Revisited

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

Type

conference paper

Language

English

Authors

Rychnovský Lukáš, Ing., Ph.D.

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

Published

2009

Pages

440–444

Proceedings

Proceedings of the 15th Conference STUDENT EEICT 2009

Conference

Student EEICT 2009

ISBN

978-80-214-3870-5

Publisher

Faculty of Information Technology BUT

Place

Brno

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

Projects

Multi-Information Technologies, GACR, Standardní projekty, GA201/07/0005, start: 2007-01-01, end: 2009-12-31, completed

Research groups

Formal Model Research Group (RG FM)

Departments

Department of Information Systems (DIFS)