TRANSFORMATION SEMIGROUP OF THE FINITE AUTOMATA AND ITS RECOGNIZATION INFORMATION
Article
Figures
Metrics
Preview PDF
Reference
Related
Cited by
Materials
Abstract:
In the analysis and cotnriol of sequencense system, We Want to know the behaviour of the systen, i.e what information ( or input) applied to the system can reach expected state ( or output ) . This problem is concerned with the recognization problem of the finite automata. A way to use (0,1 )-matrix to calculate this transf rmation semigroup of the finite automata and its recognization information is proposed, and variour specific (0, 1 ) -matrix represents information is analyzed in this paper.
