The following pages link to The Theory of Definite Automata (Q5540449):
Displaying 38 items.
- Synchronizing automata with finitely many minimal synchronizing words (Q553327) (← links)
- 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)
- On the smoothness of paging algorithms (Q1743122) (← 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)
- Remarks on external contextual grammars with selection (Q1998866) (← links)
- A trichotomy for regular simple path queries on graphs (Q2009646) (← links)
- Closure properties of subregular languages under operations (Q2104140) (← links)
- The labeling graphs of definite automata (Q2191527) (← links)
- Determination of finite automata accepting subregular languages (Q2271457) (← links)
- A sufficient condition to polynomially compute a minimum separating DFA (Q2282132) (← links)
- Concatenation-free languages (Q2357107) (← 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)
- Number of labelings of definite automata graphs (Q2674670) (← links)
- P(l)aying for Synchronization (Q2914704) (← links)
- Aspects of Reversibility for Classical Automata (Q2944881) (← links)
- Expressive Capacity of Concatenation Freeness (Q2947422) (← 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)
- On Rough Approximations of Languages under Infinite Index Indiscernibility Relations (Q5164858) (← links)
- Definite and Quasidefinite Sets of Stochastic Matrices (Q5528216) (← links)
- (Q5576262) (← links)
- Relations of contextual grammars with strictly locally testable selection languages (Q6186541) (← links)
- Strictly Locally Testable and Resources Restricted Control Languages in Tree-Controlled Grammars (Q6204140) (← links)
- An exploration of reversible septenary number-conserving cellular automata: a survey of known methods (Q6535751) (← links)
- Remarks on context-free grammars with subregular control languages (Q6589853) (← links)
