The Theoretical Study of The Structure of Automaton andFormal Languages
Zhu Ping · 2003
In this paper ,we study the theoretical construction of automaton theory and formal language theory by using the algebraic theory of semigroups. First, we construct a monoid of a finite automaton, analyse its properties, and apply these results to the nondeterministic finite automation. Then, we analyse the monoid generated by the alphabets with the concatenation calculation, give the semiring formed by the binary systematic strings and study its construction.