Structure and Transition-Preserving Functions of Finite Automata
From MaRDI portal
Publication:5565126
DOI10.1145/321439.321448zbMath0175.28001OpenAlexW2076015212MaRDI QIDQ5565126
Publication date: 1968
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/321439.321448
Related Items (17)
Characterization of state-independent automata ⋮ On structure and representations of cyclic automata ⋮ Representations of commutative asynchronous automata ⋮ Polynomial-time algorithms for testing strong isomorphism and computing the automorphism group of \(R\)-strongly connected automata ⋮ DISTINGUISHABILITY AND COMPLETENESS OF CRISP DETERMINISTIC FUZZY AUTOMATA ⋮ On a decomposition of fuzzy automata ⋮ On the number of automorphisms of non-cyclic automata ⋮ A characterization of automata and a direct product decomposition ⋮ On the structure of Abelian automata ⋮ A representation of strongly connected automata and its applications ⋮ Endomorphisms of linear automata ⋮ On \(L^M\)-valued automata: an operator oriented view ⋮ Operation-preserving functions and autonomous factors of finite automata ⋮ Induced permutation automata and coverings of strongly connected automata ⋮ Different Operators in Automata Theory Based on Residuated and Co-Residuated Lattices ⋮ Measure of Operators Associated with Fuzzy Automata ⋮ Semigroups and automorphism groups of strongly connected automata
This page was built for publication: Structure and Transition-Preserving Functions of Finite Automata
