DocumentCode
581891
Title
Bi-decomposition analysis and algorithm of automata based on semi-tensor product
Author
Yanqiong, Zhang ; Xiangru, Xu ; Yiguang, Hong
Author_Institution
Key Lab. of Syst. & Control, Acad. of Math. & Syst. Sci., Beijing, China
fYear
2012
fDate
25-27 July 2012
Firstpage
2151
Lastpage
2156
Abstract
In this paper, we study the bi-decomposition of automata in two standard ways. With semi-tensor product, the matrix-based expression of automata is given and then the decomposition procedure is realized by the matrix calculation. Necessary and sufficient conditions for both product and parallel decomposability of deterministic finite automata are provided and examples are also given for illustration.
Keywords
deterministic automata; finite automata; matrix multiplication; tensors; bidecomposition algorithm; bidecomposition analysis; deterministic finite automata; matrix calculation; matrix-based expression; necessary and sufficient conditions; parallel decomposability; semitensor product; Algorithm design and analysis; Automata; Doped fiber amplifiers; Equations; Laboratories; Matrix decomposition; Vectors; Decomposition; Finite Automata; Parallel Composition; Product Composition; Semi-tensor Product;
fLanguage
English
Publisher
ieee
Conference_Titel
Control Conference (CCC), 2012 31st Chinese
Conference_Location
Hefei
ISSN
1934-1768
Print_ISBN
978-1-4673-2581-3
Type
conf
Filename
6390280
Link To Document