Pages that link to "Item:Q4632446"
From MaRDI portal
The following pages link to Pumping, cleaning and symbolic constraints solving (Q4632446):
Displayed 9 items.
- Decidability of equivalence for deterministic synchronized tree automata (Q671682) (← links)
- Abstract data type systems (Q1391729) (← links)
- Recognizable tree-languages and nonlinear morphisms (Q1603692) (← links)
- Multitree automata that count (Q1770418) (← links)
- Ground reducibility is EXPTIME-complete (Q1887142) (← links)
- Specification and proof in membership equational logic (Q1978640) (← links)
- Tree automata with equality constraints modulo equational theories (Q2426520) (← links)
- E-generalization using grammars (Q2457667) (← links)
- Grid structures and undecidable constraint theories (Q5941204) (← links)