scientific article; zbMATH DE number 1740166
From MaRDI portal
Publication:4330728
Recommendations
- An Efficient Algorithm for the Inclusion Problem of a Subclass of DPDAs
- Ramsey goes visibly pushdown
- Monoid-based approach to the inclusion problem on superdeterministic pushdown automata
- Efficient Inclusion Checking for Deterministic Tree Automata and DTDs
- Ramsey-based inclusion checking for visibly pushdown automata
Cited in
(8)- Monoid-based approach to the inclusion problem on superdeterministic pushdown automata
- An intersection type system for deterministic pushdown automata
- Efficient Inclusion Checking for Deterministic Tree Automata and DTDs
- An Efficient Algorithm for the Inclusion Problem of a Subclass of DPDAs
- The inclusion problem for regular expressions
- Ramsey-based inclusion checking for visibly pushdown automata
- Ramsey goes visibly pushdown
- Scheme inclusion verification algorithm in algebraic model of programs with constants
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4330728)
