Language inclusion algorithms as complete abstract interpretations

DOI10.1007/978-3-030-32304-2_8zbMATH Open1539.68134MaRDI QIDQ6536285FDOQ6536285

Authors: Pierre Ganty, Francesco Ranzato, Pedro Valero 

Publication date: 19 April 2024

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Checking NFA equivalence with bisimulations up to congruence
• Well-structured transition systems everywhere!
• Antichains: A New Algorithm for Checking Universality of Finite Automata
• Title not available (Why is that?)
• Making abstract interpretations complete
• On regularity of context-free languages
• On context-free languages and push-down automata
• Title not available (Why is that?)
• Title not available (Why is that?)
• Well quasi-orders and regular languages
• Petri nets and regular processes
• Well-quasi-orders and regular \(\omega\)-languages
• Nested antichains for WS1S
• Sound up-to techniques and complete abstract domains
• Trace inclusion for one-counter nets revisited
• Complete abstractions everywhere

This page was built for publication: Language inclusion algorithms as complete abstract interpretations

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