The following pages link to Restarting automata (Q5055900):
Displaying 42 items.
- Weighted restarting automata and pushdown relations (Q287429) (← links)
- Restarting transducers, regular languages, and rational relations (Q493655) (← links)
- Deterministic ordered restarting automata for picture languages (Q748435) (← links)
- Restarting automata with restricted utilization of auxiliary symbols (Q860860) (← links)
- Marcus \(t\)-contextual grammars and cut hierarchies and monotonicity for restarting automata (Q860892) (← links)
- Degrees of non-monotonicity for restarting automata (Q861249) (← links)
- On the complexity of 2-monotone restarting automata (Q927391) (← links)
- Succinct description of regular languages by weak restarting automata (Q948085) (← links)
- On determinism versus nondeterminism for restarting automata (Q948093) (← links)
- On special forms of restarting automata (Q1592926) (← links)
- Weighted restarting automata (Q1797778) (← links)
- Universal insertion grammars of size two (Q2004002) (← links)
- Descriptional complexity of regular languages (Q2074214) (← links)
- Reversibility of computations in graph-walking automata (Q2216129) (← links)
- Lambda-confluence for context rewriting systems (Q2344748) (← links)
- Regulated variants of limited context restarting automata (Q2358691) (← links)
- Sorted dependency insertion grammars (Q2368947) (← links)
- Deterministic pushdown-CD-systems of stateless deterministic R(1)-automata (Q2391861) (← links)
- Context-free languages can be accepted with absolutely no space overhead (Q2581536) (← links)
- Two-way deterministic automata with jumping mode (Q2661767) (← links)
- Restarting automata, Church-Rosser languages, and representations of {r. e. \ }languages (Q2708956) (← links)
- Weak cyclic forms of rw-automata (Q2708957) (← links)
- A Hierarchy of Transducing Observer Systems (Q2799221) (← links)
- Reversible Ordered Restarting Automata (Q2822491) (← links)
- On the classes of languages accepted by limited context restarting automata (Q2877374) (← links)
- On the Descriptional Complexity of the Window Size for Deterministic Restarting Automata (Q2914714) (← links)
- Weighted Restarting Automata and Pushdown Relations (Q2947160) (← links)
- Hierarchies of weakly monotone restarting automata (Q3025320) (← links)
- Non-recursive trade-offs for deterministic restarting automata (Q3517104) (← links)
- Monotonicity of restarting automata (Q3517257) (← links)
- (Q4452052) (← links)
- Restarting automata (Q5055900) (← links)
- A Complete Taxonomy of Restarting Automata without Auxiliary Symbols* (Q5164869) (← links)
- Left-to-right regular languages and two-way restarting automata (Q5321782) (← links)
- Restarting Tree Automata (Q5448801) (← links)
- Developments in Language Theory (Q5473679) (← links)
- Developments in Language Theory (Q5711959) (← links)
- On deterministic ordered restart-delete automata (Q5919676) (← links)
- A hierarchy of jumping restarting automata (Q6180004) (← links)
- Non-returning deterministic and nondeterministic finite automata with translucent letters (Q6186539) (← links)
- Restarting automata with rewriting (Q6560195) (← links)
- On properties of languages accepted by deterministic pushdown automata with translucent input letters (Q6666799) (← links)
