Antichains algorithms for the inclusion problem between -VPL
From MaRDI portal
Publication:6535360
Recommendations
Cites work
- Additive number theory via automata theory
- Advanced Ramsey-based Büchi automata inclusion testing
- Antichain algorithms for finite automata
- Antichain-Based Universality and Inclusion Testing over Nondeterministic Finite Tree Automata
- Antichains: A New Algorithm for Checking Universality of Finite Automata
- Complete Abstractions for Checking Language Inclusion
- Decidability for Sturmian words
- Efficient Büchi universality checking
- FORQ-Based Language Inclusion Formal Testing
- scientific article; zbMATH DE number 599132 (Why is no real title available?)
- scientific article; zbMATH DE number 7730605 (Why is no real title available?)
- Nested interpolants
- Operator precedence and the visibly pushdown property
- Ramsey goes visibly pushdown
- Ramsey-based inclusion checking for visibly pushdown automata
- Syntactic Analysis and Operator Precedence
- Visibly pushdown automata: universality and inclusion via antichains
- Well quasi-orders and regular languages
This page was built for publication: Antichains algorithms for the inclusion problem between \(\omega\)-VPL
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6535360)