The following pages link to Superdeterministic PDAs (Q3912024):
Displaying 18 items.
- Propositional dynamic logic of nonregular programs (Q792083) (← links)
- Generalized parenthesis languages and minimization of their parenthesis parts (Q800093) (← links)
- On derivation preservation (Q1058859) (← links)
- Superdeterministic DPDAs: The method of accepting does affect decision problems (Q1132642) (← links)
- On the decidability of equivalence for deterministic pushdown transducers (Q1158772) (← links)
- Nest sets and relativized closure properties (Q1170892) (← links)
- On equivalence and subclass containment problems for deterministic context-free languages (Q1251906) (← links)
- DM-automata and classes of context-free languages (Q1899535) (← links)
- The inclusion problem for some subclasses of context-free languages (Q1978515) (← links)
- A note on undercover relation (Q2265818) (← links)
- Verification of opacity and diagnosability for pushdown systems (Q2375627) (← links)
- Inclusion between the frontier language of a non-deterministic recursive program scheme and the Dyck language is undecidable (Q2422040) (← links)
- Monoid-Based Approach to the Inclusion Problem on Superdeterministic Pushdown Automata (Q2817405) (← links)
- String Analysis as an Abstract Interpretation (Q3075489) (← links)
- THE INCLUSION PROBLEM OF CONTEXT-FREE LANGUAGES: SOME TRACTABLE CASES (Q3086239) (← links)
- The Inclusion Problem of Context-Free Languages: Some Tractable Cases (Q3637217) (← links)
- (Q3956423) (← links)
- A subclass of deterministic context-free languages with a decidable inclusion problem (Q4007469) (← links)
