Controlled Finite Automata
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26230%2F14%3APU111904" target="_blank" >RIV/00216305:26230/14:PU111904 - isvavai.cz</a>
Result on the web
<a href="http://link.springer.com/article/10.1007/s00236-014-0199-5" target="_blank" >http://link.springer.com/article/10.1007/s00236-014-0199-5</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/s00236-014-0199-5" target="_blank" >10.1007/s00236-014-0199-5</a>
Alternative languages
Result language
angličtina
Original language name
Controlled Finite Automata
Original language description
This paper discusses finite automata regulated by control languages over their states and transition rules. It proves that under both regulations, regular-controlled finite automata and context-free-controlled finite automata characterize the family of regular languages and the family of context-free languages, respectively. It also establishes conditions under which any state-controlled finite automaton can be turned into an equivalent transition-controlled finite automaton and vice versa. The paper also demonstrates a close relation between these automata and programmed grammars. Indeed, it proves that finite automata controlled by languages generated by propagating programmed grammars with appearance checking are computationally complete. In fact, it demonstrates that this computational completeness holds even in terms of these automata with a reduced number of states.
Czech name
—
Czech description
—
Classification
Type
J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database
CEP classification
—
OECD FORD branch
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
Result continuities
Project
Result was created during the realization of more than one project. More information in the Projects tab.
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2014
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 Informatica
ISSN
0001-5903
e-ISSN
1432-0525
Volume of the periodical
51
Issue of the periodical within the volume
5
Country of publishing house
DE - GERMANY
Number of pages
11
Pages from-to
327-337
UT code for WoS article
000339103700003
EID of the result in the Scopus database
2-s2.0-84903900178