scientific article; zbMATH DE number 3999303
[For the entire collection see Zbl 0593.00024.] This paper deals with the influence of different morphisms of deterministic finite automata on their behavior. Various properties of automata with respect to such morphisms like: state homomorphisms, state isomorphisms, generalized homomorphisms and generalized isomorphisms are considered. Among these properties are: set of successors, set of predecessors, genetic set, set of generators, subautomaton, primary, and connectivity properties such as: connectedness, strong connectedness, retrievability, semiretrievability, reversibility, partial reversibility, potential reversibility, onto-property and reflexiveness. The fundamental question we are dealing with in this paper is the following: is the property of finite automata under consideration preserved with respect to different morphisms of automata?
- Structural Preserving Morphisms of Finite Automata and an Application to Graph Isomorphism
- Publication:4206411
- Structure and Transition-Preserving Functions of Finite Automata
- scientific article; zbMATH DE number 3846879
- On the homomorphisms of strongly connected finite automata into substitution automata
- scientific article; zbMATH DE number 3913687 (Why is no real title available?)
- Structural Preserving Morphisms of Finite Automata and an Application to Graph Isomorphism
- scientific article; zbMATH DE number 3577164 (Why is no real title available?)
- scientific article; zbMATH DE number 4126711 (Why is no real title available?)
- scientific article; zbMATH DE number 492869 (Why is no real title available?)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4725757)