scientific article; zbMATH DE number 3915631

From MaRDI portal
Publication:3691065





Generalizing some results due to V. G. Bodnarčuk we give some statements on the solvability of language matrix equations of form \(Y=NY+P\). The obtained results make it possible to generalize the analysis algorithm of finite automata suggested by M. A. Spivak. Let \({\mathfrak A}=(A,X,\delta)\) be a finite automaton with state set \(A=(a_ 1,...,a_ n)\), with input set X and transition function \(\delta\). Let \(A^{(1)},...,A^{(r)}\) be a system of final state sets. Simultaneous determination of languages recognized in the acceptors \({\mathfrak A}_{ij}=(A,a_ i,X,\delta,A^{(j)})\) \((a_ i\in A\); \(j=1,...,r)\) is equivalent to solving a language matrix equation of the above form. On the other hand, a method is given for constructing finite automata which are able to recognize two or more regular languages. The given algorithm is different from the well-known method of V. M. Gluškov of synthesis of finite automata.











This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3691065)