Antichains algorithms for the inclusion problem between -VPL

DOI10.1007/978-3-031-30823-9_15zbMATH Open1543.68168MaRDI QIDQ6535360FDOQ6535360

Authors: Pierre Ganty, Luka Hadži-Đokić 

Publication date: 13 December 2023

Recommendations

• Visibly pushdown automata: universality and inclusion via antichains
• Ramsey goes visibly pushdown
• Ramsey-based inclusion checking for visibly pushdown automata
• Language inclusion algorithms as complete abstract interpretations
• On Model Checking for Visibly Pushdown Automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Combinatorics of partially ordered sets (06A07) Combinatorics on words (68R15) Algorithms on strings (68W32)

Cites Work

• Nested interpolants
• Antichain algorithms for finite automata
• Antichains: A New Algorithm for Checking Universality of Finite Automata
• Title not available (Why is that?)
• Syntactic Analysis and Operator Precedence
• Well quasi-orders and regular languages
• Operator precedence and the visibly pushdown property
• Efficient Büchi universality checking
• Advanced Ramsey-based Büchi automata inclusion testing
• Antichain-Based Universality and Inclusion Testing over Nondeterministic Finite Tree Automata
• Additive number theory via automata theory
• Visibly pushdown automata: universality and inclusion via antichains
• Ramsey-based inclusion checking for visibly pushdown automata
• Ramsey goes visibly pushdown
• Complete Abstractions for Checking Language Inclusion
• Decidability for Sturmian words
• Title not available (Why is that?)
• FORQ-Based Language Inclusion Formal Testing

Cited In (1)

• Language inclusion algorithms as complete abstract interpretations

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)