Loading [MathJax]/extensions/TeX/ieeemacros.js
Stabilization of deterministic finite automata based on linear state equation representation | IEEE Conference Publication | IEEE Xplore

Stabilization of deterministic finite automata based on linear state equation representation


Abstract:

This paper discusses the state feedback stabilization problem of a deterministic finite automaton (DFA), based on its state equation representation recently proposed by t...Show More

Abstract:

This paper discusses the state feedback stabilization problem of a deterministic finite automaton (DFA), based on its state equation representation recently proposed by the authors. First, a linear state equation representation of the DFA is briefly explained. Next, after the notion of equilibrium points and stabilizability of the DFA are defined, a necessary and sufficient condition for the DFA to be stabilizable is derived. Then under these preparations, a characterization of all stabilizing state feedback controllers is presented. Finally, a simple example is given to show how to follow the proposed procedure.
Date of Conference: 23-26 August 2009
Date Added to IEEE Xplore: 02 April 2015
Print ISBN:978-3-9524173-9-3
Conference Location: Budapest, Hungary

References

References is not available for this document.