Complete Abstractions for Checking Language Inclusion

DOI10.1145/3462673MaRDI QIDQ5056350zbMATH OpenOpenAlexFDO

Authors Pierre Ganty, Pedro Valero, Francesco Ranzato

Publication date 8 December 2022

Published in ACM Transactions on Computational Logic (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1904.01388

zbMATH Keywords

abstract interpretationautomatoncompletenesscontext-free languagegrammarlanguage inclusionone-counter netregular language

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• FORQ-Based Language Inclusion Formal Testing
• Advanced Ramsey-based Büchi automata inclusion testing
• When simulation meets antichains. (On checking language inclusion of nondeterministic finite (tree) automata)
• An intersection type system for deterministic pushdown automata
• Proving language inclusion and equivalence by coinduction

Cited in

(4)

• Abstraction refinement and antichains for trace inclusion of infinite state systems
• FORQ-Based Language Inclusion Formal Testing
• Antichains algorithms for the inclusion problem between \(\omega\)-VPL
• Language inclusion algorithms as complete abstract interpretations

This page was built for publication: Complete Abstractions for Checking Language Inclusion

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5056350)