Back to Search
Start Over
Complexity of Control on Finite Automata
- Source :
- IEEE Transactions on Automatic Control. 51:977-986
- Publication Year :
- 2006
- Publisher :
- Institute of Electrical and Electronics Engineers (IEEE), 2006.
-
Abstract
- We consider control questions for finite automata viewed as input/output systems. In particular, we find estimates of the minimal number of states of an automaton able to control a given automaton. We prove that, on average, feedback closed-loop control automata do not have fewer states than open-loop control automata when the control objective is to steer the controlled automaton to a target state. We compare our approach to other ways of formalizing of formalizing analogous control objectives.
- Subjects :
- TheoryofComputation_COMPUTATIONBYABSTRACTDEVICES
Theoretical computer science
Nested stack automaton
Computer science
Timed automaton
Büchi automaton
ω-automaton
Reversible cellular automaton
Nondeterministic finite automaton with ε-moves
Stochastic cellular automaton
DFA minimization
Control theory
Deterministic automaton
Continuous spatial automaton
Quantum finite automata
Two-way deterministic finite automaton
Nondeterministic finite automaton
Electrical and Electronic Engineering
Finite-state machine
Powerset construction
Continuous automaton
Pushdown automaton
Nonlinear Sciences::Cellular Automata and Lattice Gases
Computer Science Applications
Automaton
Mobile automaton
TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES
Deterministic finite automaton
Control and Systems Engineering
Probabilistic automaton
Automata theory
Computer Science::Formal Languages and Automata Theory
Subjects
Details
- ISSN :
- 00189286
- Volume :
- 51
- Database :
- OpenAIRE
- Journal :
- IEEE Transactions on Automatic Control
- Accession number :
- edsair.doi...........e60b677b488f5499598b21b9fb3448ae
- Full Text :
- https://doi.org/10.1109/tac.2006.876948