Superdeterministic PDAs
From MaRDI portal
Publication:3912024
DOI10.1145/322217.322224zbMath0462.68030OpenAlexW2125766500MaRDI QIDQ3912024
Sheila A. Greibach, Emily P. Friedman
Publication date: 1980
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/322217.322224
equivalence problemDyck setdeterministic pushdown store automatonparanthesis languagesuperdeterministic languages
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (18)
Verification of opacity and diagnosability for pushdown systems ⋮ DM-automata and classes of context-free languages ⋮ A subclass of deterministic context-free languages with a decidable inclusion problem ⋮ Superdeterministic DPDAs: The method of accepting does affect decision problems ⋮ Inclusion between the frontier language of a non-deterministic recursive program scheme and the Dyck language is undecidable ⋮ On the decidability of equivalence for deterministic pushdown transducers ⋮ Nest sets and relativized closure properties ⋮ The inclusion problem for some subclasses of context-free languages ⋮ Unnamed Item ⋮ A note on undercover relation ⋮ On equivalence and subclass containment problems for deterministic context-free languages ⋮ String Analysis as an Abstract Interpretation ⋮ THE INCLUSION PROBLEM OF CONTEXT-FREE LANGUAGES: SOME TRACTABLE CASES ⋮ Monoid-Based Approach to the Inclusion Problem on Superdeterministic Pushdown Automata ⋮ The Inclusion Problem of Context-Free Languages: Some Tractable Cases ⋮ Propositional dynamic logic of nonregular programs ⋮ On derivation preservation ⋮ Generalized parenthesis languages and minimization of their parenthesis parts
This page was built for publication: Superdeterministic PDAs
