Pages that link to "Item:Q443731"
From MaRDI portal
The following pages link to The size-cost of Boolean operations on constant height deterministic pushdown automata (Q443731):
Displaying 9 items.
- Alternating space is closed under complement and other simulations for sublogarithmic space (Q515583) (← links)
- Two double-exponential gaps for automata with a limited pushdown (Q515677) (← links)
- The descriptional power of queue automata of constant length (Q2041686) (← links)
- Deterministic and nondeterministic iterated uniform finite-state transducers: computational and descriptional power (Q2106594) (← links)
- Removing nondeterminism in constant height pushdown automata (Q2252532) (← links)
- Boolean language operations on nondeterministic automata with a pushdown of constant height (Q2403237) (← links)
- Computational and Descriptional Power of Nondeterministic Iterated Uniform Finite-State Transducers* (Q5089680) (← links)
- Non-Self-Embedding Grammars, Constant-Height Pushdown Automata, and Limited Automata (Q5859666) (← links)
- Descriptional complexity of iterated uniform finite-state transducers (Q5918615) (← links)
