Regulated Pushdown Automata Revisited
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26230%2F09%3APU86250" target="_blank" >RIV/00216305:26230/09:PU86250 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Regulated Pushdown Automata Revisited
Original language description
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,<br>2000. Pages 653-664.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
JC - Computer hardware and software
OECD FORD branch
—
Result continuities
Project
<a href="/en/project/GA201%2F07%2F0005" target="_blank" >GA201/07/0005: Multi-information technologies: Theory, models, and methods</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2009
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
Proceedings of the 15th Conference STUDENT EEICT 2009
ISBN
978-80-214-3870-5
ISSN
—
e-ISSN
—
Number of pages
5
Pages from-to
—
Publisher name
Faculty of Information Technology BUT
Place of publication
Brno
Event location
FEKT VUT v Brně
Event date
Apr 23, 2009
Type of event by nationality
CST - Celostátní akce
UT code for WoS article
—