scientific article

A. S. Podkolzin, Stanislav V. Aleshin, Valerii B. Kudryavtsev

Publication date: 1985

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

algorithms closure operations finite automata homogeneous structures structural automata bounded deterministic functions

Mathematics Subject Classification ID

Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Formal languages and automata (68Q45) Algebraic theory of languages and automata (68Q70) Cellular automata (computational aspects) (68Q80)

Related Items (51)

Automata model for verifying attibuted-based access control policy in systems with a finite number of objects ⋮ One-counter pushdown-storage automata as transducers of sequences ⋮ The classification of abelian groups generated by time-varying automata and by Mealy automata over the binary alphabet ⋮ Automata transformations of prefix decidable and decidable by Buchi superwords ⋮ Completeness problem for the class of linear automata functions ⋮ Finite automata and numbers ⋮ Algebraic interpretation of a microprogram finite-state machine with datapath of transitions ⋮ An optimal in order method of synthesis of a search operator in the class of automaton circuits of a special form ⋮ Independent systems of automata in labyrinths ⋮ On the number of reversible homogeneous structures ⋮ On the complexity of testing primality by homogeneous structures ⋮ On distinguishability of states of automata ⋮ On glueing states of an automaton ⋮ On special properties of a composition of automata ⋮ Normal bases of PI-algebras. ⋮ On solving automaton equations ⋮ Weak equivalence of automata ⋮ On Mealy–Moore coding and images of Markov measures ⋮ Indistinguishability of finite automata with constrained behavior ⋮ Upper estimate of partial prediction degree for general regular superevents ⋮ Automaton barriers ⋮ Bounds on orders of linear automata ⋮ Some Algebraic Properties of Machine Poset of Infinite Words ⋮ Unnamed Item ⋮ Collectives of automata in finitely generated groups ⋮ Automata in algebra ⋮ Kernel of a class of automata indistinguishable by a simple experiment ⋮ ON THE LOCAL INVERTIBILITY OF FINITE STATE INFORMATION LOSSLESS AUTOMATA ⋮ Linearly realizable automata ⋮ Maximum subclasses in classes of linear automata over finite fields ⋮ On automaton determinisation of sets of superwords ⋮ Cardinality of the set of all precomplete classes for definite automata ⋮ Automata algebras ⋮ Analysis and synthesis of abstract automata ⋮ One automaton model in biology ⋮ Unary algebras without proper subalgebras ⋮ Algebraic operations on graphs preserving the degree sequence ⋮ Periodic properties of autonomous automata with pushdown storage ⋮ Periodic properties of pushdown automata ⋮ Distinguishability of \(s\)-labyrinths ⋮ Conditions of a-completeness for linear automata over dyadic rationals ⋮ Superpositions of bounded-deterministic functions ⋮ Simple-fault checking for automata generated by a fault function ⋮ Experiments with automata when the upper bound of the number of their states is unknown ⋮ Precomplete classes of automata with the superposition operation ⋮ Solvability of the problem of completeness of automaton basis depending on its Boolean part ⋮ Adjustment experiments for automata with variable logic of behaviour ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ The classes of automata embeddable to pre-complete classes

This page was built for publication: