We study certain decompositions of a finite automaton in relationship with the factorisations of a polynomial associated to it.
CITATION STYLE
Perrin, D. (1976). The characteristic polynomial of a finite automaton. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 45 LNCS, pp. 453–457). Springer Verlag. https://doi.org/10.1007/3-540-07854-1_214
Mendeley helps you to discover research relevant for your work.