Pages that link to "Item:Q5173292"
From MaRDI portal
The following pages link to LIMITED AUTOMATA AND REGULAR LANGUAGES (Q5173292):
Displayed 16 items.
- Descriptional complexity of limited automata (Q1706157) (← links)
- Descriptional complexity of regular languages (Q2074214) (← links)
- Converting nondeterministic two-way automata into small deterministic linear-time machines (Q2105419) (← links)
- Performing regular operations with 1-limited automata (Q2164004) (← links)
- Between SC and LOGDCFL: families of languages accepted by polynomial-time logarithmic-space deterministic auxiliary depth-\(k\) storage automata (Q2695283) (← links)
- Deterministic Stack Transducers (Q2830204) (← links)
- Reversible Limited Automata (Q2945882) (← links)
- Deterministic Stack Transducers (Q4605515) (← links)
- On Simulation Cost of Unary Limited Automata (Q5500689) (← links)
- Non-Self-Embedding Grammars, Constant-Height Pushdown Automata, and Limited Automata (Q5859666) (← links)
- (Q5867525) (← links)
- Limited automata and unary languages (Q5915989) (← links)
- Linear-time limited automata (Q5919709) (← links)
- Nondeterministic auxiliary depth-bounded storage automata and semi-unbounded fan-in cascading circuits (extended abstract) (Q6168931) (← links)
- Two-way machines and de Bruijn words (Q6199880) (← links)
- Once-Marking and Always-Marking 1-Limited Automata (Q6204137) (← links)