The following pages link to The Theory of Definite Automata (Q5540449):
Displayed 21 items.
- On probabilistic analog automata (Q596111) (← links)
- On the acceptance power of regular languages (Q672323) (← links)
- La représentation ergodique d'un automate fini (Q1133897) (← links)
- An interconnection of local maps inducing onto global maps (Q1139933) (← links)
- General varieties of tree languages (Q1275067) (← links)
- On the bound of the synchronization delay of a local automaton (Q1275089) (← links)
- Reset words for commutative and solvable automata (Q1392028) (← links)
- Optimal estimation on the order of local testability of finite automata (Q1575894) (← links)
- Resetting words for decidable automata (Q1905219) (← links)
- Algorithms finding the order of local testability of deterministic finite automaton and estimations of the order (Q1978707) (← links)
- Determination of finite automata accepting subregular languages (Q2271457) (← links)
- A tight linear bound on the synchronization delay of bijective automata (Q2373732) (← links)
- Locally testable languages (Q2554236) (← links)
- Characterizations of locally testable events (Q2558849) (← links)
- Constant-to-one and onto global maps of homomorphisms between strongly connected graphs (Q3333063) (← links)
- Finitely Generated Synchronizing Automata (Q3618621) (← links)
- SYSTEM IDENTIFICATION, APPROXIMATION AND COMPLEXITY (Q4111346) (← links)
- Local maps inducing surjective global maps of one-dimensional tessellation automata (Q4171557) (← links)
- Algebraic decision procedures for local testability (Q4773689) (← links)
- Definite and Quasidefinite Sets of Stochastic Matrices (Q5528216) (← links)
- (Q5576262) (← links)