Controllability, Reachability, and Stabilizability of Finite Automata: A Controllability Matrix Method

Yalu Li, Wenhui Dou, Haitao Li and Xin Liu

Mathematical Problems in Engineering, 2018, vol. 2018, 1-6

Abstract:

This paper investigates the controllability, reachability, and stabilizability of finite automata by using the semitensor product of matrices. Firstly, by expressing the states, inputs, and outputs as vector forms, an algebraic form is obtained for finite automata. Secondly, based on the algebraic form, a controllability matrix is constructed for finite automata. Thirdly, some necessary and sufficient conditions are presented for the controllability, reachability, and stabilizability of finite automata by using the controllability matrix. Finally, an illustrative example is given to support the obtained new results.

Date: 2018
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/MPE/2018/6719319.pdf (application/pdf)
http://downloads.hindawi.com/journals/MPE/2018/6719319.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jnlmpe:6719319

DOI: 10.1155/2018/6719319

Access Statistics for this article

More articles in Mathematical Problems in Engineering from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().