Antichains algorithms for the inclusion problem between -VPL

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

Author name not available (Why is that?), Pierre Ganty, Luka Hadži-Đokić

Publication date: 13 December 2023

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
• Title not available (Why is that?)
• Title not available (Why is that?)
• FORQ-Based Language Inclusion Formal Testing

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)