Reachability and controllability analysis of probabilistic finite automata via a novel matrix method

2019 ◽  
Vol 21 (6) ◽  
pp. 2578-2586 ◽  
Author(s):  
Zhipeng Zhang ◽  
Zengqiang Chen ◽  
Zhongxin Liu
Keyword(s):  
Matrix Method ◽  
Finite Automata ◽  
Probabilistic Finite Automata

Remarks on Four-Dimensional Probabilistic Finite Automata

2014 ◽  
Author(s):  
Makoto Sakamoto ◽  
Hiroshi Furutani ◽  
Yasuo Uchida ◽  
Makoto Nagatomo ◽  
Tuo Zhang ◽  
...  
Keyword(s):  
Finite Automata ◽  
Probabilistic Finite Automata

Decision Problems for Probabilistic Finite Automata on Bounded Languages

2013 ◽  
Vol 123 (1) ◽  
pp. 1-14 ◽  
Author(s):  
Paul C. Bell ◽  
Vesa Halava ◽  
Mika Hirvensalo
Keyword(s):  
Finite Automata ◽  
Decision Problems ◽  
Probabilistic Finite Automata

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

2018 ◽  
Vol 2018 ◽  
pp. 1-6 ◽  
Author(s):  
Yalu Li ◽  
Wenhui Dou ◽  
Haitao Li ◽  
Xin Liu
Keyword(s):  
Matrix Method ◽  
Finite Automata ◽  
Sufficient Conditions ◽  
Necessary And Sufficient Conditions ◽  
Algebraic Form ◽  
Controllability Matrix ◽  
Necessary And Sufficient ◽  
Semitensor Product Of Matrices ◽  
Product Of Matrices ◽  
Inputs And Outputs

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.

Concise representations of regular languages by degree and probabilistic finite automata

1993 ◽  
Vol 26 (4) ◽  
pp. 379-395 ◽  
Author(s):  
Chandra M. R. Kintala ◽  
Kong -Yee Pun ◽  
Detlef Wotschke
Keyword(s):  
Finite Automata ◽  
Regular Languages ◽  
Probabilistic Finite Automata

scholarly journals On the Learnability and Usage of Acyclic Probabilistic Finite Automata

1998 ◽  
Vol 56 (2) ◽  
pp. 133-152 ◽  
Author(s):  
Dana Ron ◽  
Yoram Singer ◽  
Naftali Tishby
Keyword(s):  
Finite Automata ◽  
Probabilistic Finite Automata

Remarks on Four-Dimensional Probabilistic Finite Automata

2015 ◽  
Vol 9 (6) ◽  
pp. 91-100
Author(s):  
Makoto Sakamoto ◽  
Yasuo Uchida ◽  
Makoto Nagatomo ◽  
Tuo Zhang ◽  
Hikaru Susaki ◽  
...  
Keyword(s):  
Finite Automata ◽  
Probabilistic Finite Automata
Sign in / Sign up

Export Citation Format

Share Document