VATA: A Library for Efficient Manipulation of Non-deterministic Tree Automata
From MaRDI portal
Recommendations
- VLDL satisfiability and model checking via tree automata
- Towards an Efficient Implementation of Tree Automata Completion
- Proceedings of the 2nd international workshop on trends in tree automata and tree transducers, TTATT'13, Hanoi, Vietnam, October 19, 2013
- Efficient evaluation of nondeterministic automata using factorization forests
- Visibly Tree Automata with Memory and Constraints
- Nondeterministic Tree Automata
- An Implementation of Deterministic Tree Automata Minimization
- scientific article; zbMATH DE number 3997174
- Tree Automata with Memory, Visibility and Structural Constraints
- scientific article; zbMATH DE number 3976378
Cited in
(10)- A theoretical framework for cardinality-based feature models: the semantics and computational aspects
- Compositional entailment checking for a fragment of separation logic
- Nested antichains for WS1S
- Reduction of nondeterministic tree automata
- Efficient inclusion checking on explicit and semi-symbolic tree automata
- Symbolic tree automata
- Reasoning About Regular Properties: A Comparative Study
- Succinct determinisation of counting automata via sphere construction
- Algorithms for checking intersection non-emptiness of regular expressions
- Antichain with SAT and tries
This page was built for publication: VATA: A Library for Efficient Manipulation of Non-deterministic Tree Automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2894267)