No label defined (Q3691065)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3915631
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 3915631 |
Statements
1982
0 references
language recognizer
0 references
analysis and synthesis of automata without outputs
0 references
language matrix equations
0 references
finite automata
0 references
regular languages
0 references
algorithm
0 references
0.7819826602935791
0 references
0.7775449156761169
0 references
0.7665438652038574
0 references
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.
0 references