论文信息 - Equivalence, Reduction and Minimization of Finite Automata over Semirings

Equivalence, Reduction and Minimization of Finite Automata over Semirings

Abstract A new unified approach to equivalence, reduction and minimization of finite automata over semirings, based on free semimodules, is presented. It includes as special cases deterministic, nondeterministic, stochastic and fuzzy automata. A necessary and sufficient condition for the existence of a finite behaviour matrix for a given automaton is proved. Different algorithmical decidability properties for equivalence, reduction and minimization are connected to a Noetherian property in the category S Mod c of the semimodules over the semiring C .

L. Peeva | L. Peeva | Kety Peeva

[1] K. Peeva,et al. Equivalence, reduction and minimization of finite fuzzy-automata , 1981 .

[2] Eugene S. Santos. On reductions of maximin machines , 1972 .

[3] Didier Dubois,et al. Fuzzy sets and systems ' . Theory and applications , 2007 .

[4] Arto Salomaa,et al. Semirings, Automata, Languages , 1985, EATCS Monographs on Theoretical Computer Science.

[5] Lothar Budach,et al. Automaten und Funktoren , 1975 .

[6] S. Lane. Categories for the Working Mathematician , 1971 .

[7] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[8] William G. Wee,et al. General Formulation of Sequential Machines , 1968, Inf. Control..

[9] Peter J. Denning,et al. Machines, Languages, And Computation , 1978 .

[10] J. Carlyle. Reduced forms for stochastic sequential machines , 1963 .

[11] K. Peeva,et al. Systems of linear equations over a bounded chain , 1986, Acta Cybernetica.

[12] K. Peeva. Behaviour, reduction and minimization of finite :G6-automata , 1988 .