Efficient inclusion checking on explicit and semi-symbolic tree automata
DOI10.1007/978-3-642-24372-1_18zbMATH Open1348.68105OpenAlexW173662904MaRDI QIDQ3172918FDOQ3172918
Authors: Lukáš Holik, Ondřej Lengál, Jiří Šimáček, Tomáš Vojnar 
Publication date: 7 October 2011
Published in: Automated Technology for Verification and Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-24372-1_18
Recommendations
- Efficient Inclusion Checking for Deterministic Tree Automata and DTDs
- Antichain-Based Universality and Inclusion Testing over Nondeterministic Finite Tree Automata
- Efficient inclusion checking for deterministic tree automata and XML schemas
- VATA: A Library for Efficient Manipulation of Non-deterministic Tree Automata
- Implementation and Application of Automata
Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)
Cited In (5)
- Efficient inclusion checking for deterministic tree automata and XML schemas
- Efficient Inclusion Checking for Deterministic Tree Automata and DTDs
- Antichain-Based Universality and Inclusion Testing over Nondeterministic Finite Tree Automata
- Reasoning About Regular Properties: A Comparative Study
- Implementation and Application of Automata
Uses Software
This page was built for publication: Efficient inclusion checking on explicit and semi-symbolic tree automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3172918)
