Regulated Pushdown Automata
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26220%2F00%3APU28664" target="_blank" >RIV/00216305:26220/00:PU28664 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Regulated Pushdown Automata
Original language description
The paper suggests a new investigation area of the formal language theory - regulated automata. Specifically, it investigates pushdown automata that regulate the use of their rules by control languages. It proves that this regulation has no effect on thepower of pushdown automata if the control languages are regular. However, the pushdown automata regulated by linear control languages characterize the family of recursively enumerable languages.
Czech name
—
Czech description
—
Classification
Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
BD - Information theory
OECD FORD branch
—
Result continuities
Project
—
Continuities
Z - Vyzkumny zamer (s odkazem do CEZ)
Others
Publication year
2000
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
Name of the periodical
Acta Cybernetica
ISSN
0324-721X
e-ISSN
—
Volume of the periodical
2000
Issue of the periodical within the volume
4
Country of publishing house
US - UNITED STATES
Number of pages
12
Pages from-to
653-664
UT code for WoS article
—
EID of the result in the Scopus database
—