Antichain-Based Universality and Inclusion Testing over Nondeterministic Finite Tree Automata

DOI10.1007/978-3-540-70844-5_7zbMATHOpenAlexMaRDI QIDQ3602801FDO

Authors Ahmed Bouajjani, Peter Habermehl, Lukáš Holik, Tayssir Touili, Tomáš Vojnar

Publication date 12 February 2009

Published in Implementation and Applications of Automata (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-70844-5_7

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Data structures (68P05)

Recommendations

• When simulation meets antichains. (On checking language inclusion of nondeterministic finite (tree) automata)
• Antichains: A New Algorithm for Checking Universality of Finite Automata
• Efficient inclusion checking on explicit and semi-symbolic tree automata
• Antichains for the Automata-Based Approach to Model-Checking
• Efficient Inclusion Checking for Deterministic Tree Automata and DTDs

Cited in

(16)

• Weak inclusion for XML types
• Nested antichains for WS1S
• Fixpoint Guided Abstraction Refinement for Alternating Automata
• Strategy construction for parity games with imperfect information
• Implementation and Application of Automata
• Reasoning About Regular Properties: A Comparative Study
• Efficient Inclusion Checking for Deterministic Tree Automata and DTDs
• Antichains: A New Algorithm for Checking Universality of Finite Automata
• Parametric random generation of deterministic tree automata
• Antichains algorithms for the inclusion problem between \(\omega\)-VPL
• When simulation meets antichains. (On checking language inclusion of nondeterministic finite (tree) automata)
• Efficient inclusion checking on explicit and semi-symbolic tree automata
• Symbolic model checking in non-Boolean domains
• Fixed point guided abstraction refinement for alternating automata
• Automata terms in a lazy \(\mathrm{WS}k\mathrm{S}\) decision procedure
• Automata terms in a lazy \(\mathrm{WS}k\mathrm{S}\) decision procedure

This page was built for publication: Antichain-Based Universality and Inclusion Testing over Nondeterministic Finite Tree Automata

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