Boolean language operations on nondeterministic automata with a pushdown of constant height
From MaRDI portal
(Redirected from Publication:4928476)
Recommendations
- Boolean language operations on nondeterministic automata with a pushdown of constant height
- The size-cost of Boolean operations on constant height deterministic pushdown automata
- The size-cost of Boolean operations on constant height deterministic pushdown automata
- Height-Deterministic Pushdown Automata
- Removing nondeterminism in constant height pushdown automata
Cited in
(12)- The descriptional power of queue automata of constant length
- Removing nondeterminism in constant height pushdown automata
- Boolean language operations on nondeterministic automata with a pushdown of constant height
- Removing nondeterminism in constant height pushdown automata
- The size-cost of Boolean operations on constant height deterministic pushdown automata
- Computational and Descriptional Power of Nondeterministic Iterated Uniform Finite-State Transducers*
- Two double-exponential gaps for automata with a limited pushdown
- The size-cost of Boolean operations on constant height deterministic pushdown automata
- Descriptional complexity of iterated uniform finite-state transducers
- scientific article; zbMATH DE number 7770052 (Why is no real title available?)
- Two-way finite automata with translucent input letters
- Latvian quantum finite state automata for unary languages
This page was built for publication: Boolean language operations on nondeterministic automata with a pushdown of constant height
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4928476)