Removing nondeterminism in constant height pushdown automata (Q2252532): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Trace monoids with idempotent generators and measure-only quantum automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Behaviours of Unary Quantum Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmics for hard problems. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum Computation and Quantum Information / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4506483 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5541339 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5422234 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3102144 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note on the Succinctness of Deterministic, Nondeterministic, Probabilistic and Quantum Finite Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two Double-Exponential Gaps for Automata with a Limited Pushdown / rank
 
Normal rank
Property / cites work
 
Property / cites work: The size-cost of Boolean operations on constant height deterministic pushdown automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Boolean Language Operations on Nondeterministic Automata with a Pushdown of Constant Height / rank
 
Normal rank
Property / cites work
 
Property / cites work: More concise representation of regular languages by automata and regular expressions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple counter machines and number-theoretic problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5178456 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Queue Automata of Constant Length / rank
 
Normal rank
Property / cites work
 
Property / cites work: One-way stack automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Space bounded computations: Review and new separation results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Converting two-way nondeterministic unary automata into simpler automata. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complementing two-way finite automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Size Complexity of Two-Way Finite Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Descriptional complexity of two-way pushdown automata with restricted head reversals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Simulations between Unary Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4503152 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5541340 / rank
 
Normal rank

Revision as of 18:12, 8 July 2024

scientific article
Language Label Description Also known as
English
Removing nondeterminism in constant height pushdown automata
scientific article

    Statements

    Removing nondeterminism in constant height pushdown automata (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    18 July 2014
    0 references
    descriptional complexity
    0 references
    finite state automata
    0 references
    regular languages
    0 references
    deterministic and nondeterministic pushdown automata
    0 references

    Identifiers