No label defined (Q4725757)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3999303
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 3999303 |
Statements
1986
0 references
deterministic finite automata
0 references
behavior
0 references
0.7862848043441772
0 references
0.7399558424949646
0 references
0.7271915078163147
0 references
[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?
0 references