Structure and Transition-Preserving Functions of Finite Automata

DOI10.1145/321439.321448MaRDI QIDQ5565126zbMATH OpenOpenAlexFDO

Authors Zamir Bavel

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

zbMATH Keywords

finite automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• scientific article; zbMATH DE number 3902045
• On the homomorphisms of strongly connected finite automata into substitution automata
• scientific article; zbMATH DE number 8122
• Finite automata and numbers
• Structural Preserving Morphisms of Finite Automata and an Application to Graph Isomorphism

Cited in

(28)

• Characterization of state-independent automata
• Semigroup automaton structure by homomorphism and domain partition
• Polynomial-time algorithms for testing strong isomorphism and computing the automorphism group of \(R\)-strongly connected 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
• Induced permutation automata and coverings of strongly connected automata
• On a decomposition of fuzzy automata
• On \(L^M\)-valued automata: an operator oriented view
• Structural Presburger digit vector automata
• Operation-preserving functions and autonomous factors of finite automata
• Elementary decompositions of arbitrary maps over finite sets
• Metric properties of functions defined by partial automata
• Structural decomposition of a polynomial transition function into a collection of linear automation links
• scientific article; zbMATH DE number 5316019 (Why is no real title available?)
• Structural Preserving Morphisms of Finite Automata and an Application to Graph Isomorphism
• Representations of commutative asynchronous automata
• Distinguishability and completeness of crisp deterministic fuzzy automata
• scientific article; zbMATH DE number 3999303 (Why is no real title available?)
• Semigroups and automorphism groups of strongly connected automata
• On the homomorphisms of strongly connected finite automata into substitution automata
• ON THE DISAMBIGUATION OF FINITE AUTOMATA AND FUNCTIONAL TRANSDUCERS
• A characterization of totally compatible automata
• Different Operators in Automata Theory Based on Residuated and Co-Residuated Lattices
• Measure of Operators Associated with Fuzzy Automata
• On structure and representations of cyclic automata

This page was built for publication: Structure and Transition-Preserving Functions of Finite Automata

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5565126)