Pages that link to "Item:Q5915989"
From MaRDI portal
The following pages link to Limited automata and unary languages (Q5915989):
Displaying 20 items.
- Unary finite automata vs. arithmetic progressions (Q989556) (← links)
- Descriptional complexity of limited automata (Q1706157) (← links)
- Unary context-free grammars and pushdown automata, descriptional complexity and auxiliary space lower bounds. (Q1872711) (← links)
- Converting nondeterministic two-way automata into small deterministic linear-time machines (Q2105419) (← links)
- Performing regular operations with 1-limited automata (Q2164004) (← links)
- Limited automata: properties, complexity and variants (Q2179326) (← links)
- Limited automata and context-free languages (Q2805404) (← links)
- Investigations on Automata and Languages over a Unary Alphabet (Q3192250) (← links)
- Unary Languages Recognized by Two-Way One-Counter Automata (Q3192259) (← links)
- DETERMINISTIC PUSHDOWN AUTOMATA AND UNARY LANGUAGES (Q3395134) (← links)
- (Q3811727) (← links)
- (Q4240336) (← links)
- Strongly Limited Automata (Q4589240) (← links)
- Forgetting Automata and Unary Languages (Q5757251) (← links)
- Non-Self-Embedding Grammars, Constant-Height Pushdown Automata, and Limited Automata (Q5859666) (← links)
- (Q5867525) (← links)
- Linear-time limited automata (Q5919709) (← links)
- Limited automata and unary languages (Q5920129) (← links)
- Once-Marking and Always-Marking 1-Limited Automata (Q6204137) (← links)
- Performing regular operations with 1-limited automata (Q6580078) (← links)