Equivalence, reduction and minimization of finite automata over semirings (Q1177166): Difference between revisions

A new theory of finite automata over semi-rings is proposed. A unified approach to equivalence, reduction and minimization is sketched. Criteria are obtained for computability of the behaviour matrix, equivalence of states, equivalence of automata, reduction of states, finding reduced and minimal form. The relationship with Noetherian property in the category of semi-modules clarified the exposé. Deterministic, nondeterministic, stochastic and fuzzy automata are included in this unified scheme.