The following pages link to (Q3741058):
Displaying 50 items.
- Automata transformations of prefix decidable and decidable by Buchi superwords (Q309440) (← links)
- Completeness problem for the class of linear automata functions (Q314183) (← links)
- Finite automata and numbers (Q314209) (← links)
- Algebraic interpretation of a microprogram finite-state machine with datapath of transitions (Q314987) (← links)
- Cardinality of the set of all precomplete classes for definite automata (Q548746) (← links)
- Automata algebras (Q548748) (← links)
- Analysis and synthesis of abstract automata (Q548753) (← links)
- Distinguishability of \(s\)-labyrinths (Q736168) (← links)
- The classes of automata embeddable to pre-complete classes (Q785978) (← links)
- Normal bases of PI-algebras. (Q863320) (← links)
- Algebraic and structural automata theory. Transl. of algebraiczna i structuralna teoria automatów (PWN, Warsaw, 1985) (Q1188575) (← links)
- Indistinguishability of finite automata with constrained behavior (Q1375267) (← links)
- Experiments with automata when the upper bound of the number of their states is unknown (Q1570268) (← links)
- One-counter pushdown-storage automata as transducers of sequences (Q1626654) (← links)
- Linearly realizable automata (Q1744335) (← links)
- Periodic properties of autonomous automata with pushdown storage (Q1795425) (← links)
- Superpositions of bounded-deterministic functions (Q1813796) (← links)
- Simple-fault checking for automata generated by a fault function (Q1816011) (← links)
- Maximum subclasses in classes of linear automata over finite fields (Q1996832) (← links)
- Unary algebras without proper subalgebras (Q2027896) (← links)
- Conditions of a-completeness for linear automata over dyadic rationals (Q2050227) (← links)
- Automata model for verifying attibuted-based access control policy in systems with a finite number of objects (Q2131407) (← links)
- Upper estimate of partial prediction degree for general regular superevents (Q2191522) (← links)
- Collectives of automata in finitely generated groups (Q2217263) (← links)
- Periodic properties of pushdown automata (Q2288436) (← links)
- Precomplete classes of automata with the superposition operation (Q2319966) (← links)
- Solvability of the problem of completeness of automaton basis depending on its Boolean part (Q2319977) (← links)
- Automaton barriers (Q2435813) (← links)
- Automata in algebra (Q2453380) (← links)
- Algebraic operations on graphs preserving the degree sequence (Q2513089) (← links)
- The classification of abelian groups generated by time-varying automata and by Mealy automata over the binary alphabet (Q2629849) (← links)
- Bounds on orders of linear automata (Q2700030) (← links)
- Some Algebraic Properties of Machine Poset of Infinite Words (Q3526411) (← links)
- Kernel of a class of automata indistinguishable by a simple experiment (Q3806825) (← links)
- Weak equivalence of automata (Q4007436) (← links)
- An optimal in order method of synthesis of a search operator in the class of automaton circuits of a special form (Q4809615) (← links)
- Independent systems of automata in labyrinths (Q4809621) (← links)
- On the number of reversible homogeneous structures (Q4809628) (← links)
- On the complexity of testing primality by homogeneous structures (Q4809633) (← links)
- On distinguishability of states of automata (Q4809634) (← links)
- On glueing states of an automaton (Q4809636) (← links)
- On special properties of a composition of automata (Q4809653) (← links)
- On solving automaton equations (Q4825181) (← links)
- On Mealy–Moore coding and images of Markov measures (Q5082252) (← links)
- (Q5146138) (← links)
- (Q5146737) (← links)
- (Q5150502) (← links)
- ON THE LOCAL INVERTIBILITY OF FINITE STATE INFORMATION LOSSLESS AUTOMATA (Q5151204) (← links)
- On automaton determinisation of sets of superwords (Q5424056) (← links)
- One automaton model in biology (Q5439061) (← links)
