Reduction of a Kind of Finite-State Automata Over Unitary Semirings
Deng Pei-min · Journal of Guangxi Normal University · 2008
In this paper,a deterministic finite-state automata over unitary semirings and its reduction are defined,a method to determine whether its two states are distinguishable or not is obtained.For each deterministic finite-state automaton over a unitary semirings,there must exist a reductive finite-state automaton which is equivalent to it.A concrete feasible computing algorithm about the reduction of the type of automata is given.An example is given to illustrate these results.