Counting and equality constraints for multitree automata
From MaRDI portal
(Redirected from Counting and equality constraints for multitree automata)
Recommendations
Cited in
(8)- Multitree automata that count
- Alternating two-way AC-tree automata
- Tree automata with equality constraints modulo equational theories
- On symbolic verification of weakly extended PAD
- Counting in trees
- Automata on infinite trees with counting constraints
- On the reachability problem for two-dimensional branching VASS
- Bridging the gap between plain VASS and branching VASS
This page was built for publication: Counting and equality constraints for multitree automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4417868)