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

DOI10.1007/978-3-540-70844-5_7zbMath1172.68493OpenAlexW1602317429MaRDI QIDQ3602801

Lukáš Holík, Tayssir Touili, Peter Habermehl, Ahmed Bouajjani, 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)

Related Items (9)

Symbolic Model Checking in Non-Boolean Domains ⋮ Strategy construction for parity games with imperfect information ⋮ Fixed point guided abstraction refinement for alternating automata ⋮ Parametric random generation of deterministic tree automata ⋮ Nested antichains for WS1S ⋮ Weak Inclusion for XML Types ⋮ Automata terms in a lazy \(\mathrm{WS}k\mathrm{S}\) decision procedure ⋮ Automata terms in a lazy \(\mathrm{WS}k\mathrm{S}\) decision procedure ⋮ Fixpoint Guided Abstraction Refinement for Alternating Automata

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