Pages that link to "Item:Q5096180"
From MaRDI portal
The following pages link to Deciding equivalence of finite tree automata (Q5096180):
Displaying 6 items.
- Queries on XML streams with bounded delay and concurrency (Q553309) (← links)
- Haskell overloading is DEXPTIME-complete (Q1336737) (← links)
- Pushdown tree automata, algebraic tree systems, and algebraic tree series (Q1854412) (← links)
- Tree automata with equality constraints modulo equational theories (Q2426520) (← links)
- DECIDABILITY OF THE EQUIVALENCE PROBLEM FOR FINITELY AMBIGUOUS FINANCE AUTOMATA (Q4786328) (← links)
- Regular tree languages in low levels of the Wadge hierarchy (Q5232909) (← links)