Computing Simulations over Tree Automata
From MaRDI portal
Publication:5458323
Recommendations
Cites work
- scientific article; zbMATH DE number 1306878 (Why is no real title available?)
- scientific article; zbMATH DE number 1903379 (Why is no real title available?)
- Abstract Regular Tree Model Checking of Complex Dynamic Data Structures
- Abstract regular tree model checking
- Backward and Forward Bisimulation Minimisation of Tree Automata
- Bisimulation Minimization of Tree Automata
- Computing Simulations over Tree Automata
- Three Partition Refinement Algorithms
- Tree regular model checking: a simulation-based approach
Cited in
(16)- Multi-buffer simulations for trace language inclusion
- Nested antichains for WS1S
- Composed Bisimulation for Tree Automata
- Forest automata for verification of heap manipulation
- Computing Simulations over Tree Automata
- A uniform (bi-)simulation-based framework for reducing tree automata
- Automata on infinite trees
- Reduction of nondeterministic tree automata
- Accelerating tree-automatic relations
- COMPOSED BISIMULATION FOR TREE AUTOMATA
- Simulation relations for pattern matching in directed graphs
- THE CATEGORY OF SIMULATIONS FOR WEIGHTED TREE AUTOMATA
- Simulation algorithms for symbolic automata
- Multi-buffer simulations: decidability and complexity
- Mediating for reduction (on minimizing alternating Büchi automata)
- Topological characterisation of multi-buffer simulation
This page was built for publication: Computing Simulations over Tree Automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5458323)