Pushdown automata and constant height: decidability and bounds
From MaRDI portal
Publication:2179342
DOI10.1007/978-3-030-23247-4_20zbMATH Open1434.68285OpenAlexW2955313150MaRDI QIDQ2179342FDOQ2179342
Authors: Giovanni Pighizzini, Luca Prigioniero 
Publication date: 12 May 2020
Full work available at URL: https://hal.inria.fr/hal-02387302
Recommendations
- Height-Deterministic Pushdown Automata
- Removing nondeterminism in constant height pushdown automata
- Removing nondeterminism in constant height pushdown automata
- The size-cost of Boolean operations on constant height deterministic pushdown automata
- Descriptional complexity of pushdown store languages
Cited In (9)
- On the Complexity of Membership and Counting in Height-Deterministic Pushdown Automata
- On the degrees of non-regularity and non-context-freeness
- Height-Deterministic Pushdown Automata
- The size-cost of Boolean operations on constant height deterministic pushdown automata
- Variations on pushdown machines (Detailed Abstract)
- Title not available (Why is that?)
- Space Complexity of Stack Automata Models
- Space Complexity of Stack Automata Models
- Pushdown automata and constant height: decidability and bounds
This page was built for publication: Pushdown automata and constant height: decidability and bounds
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2179342)
