Pages that link to "Item:Q2855747"
From MaRDI portal
The following pages link to Parameterized complexity of basic decision problems for tree automata (Q2855747):
Displaying 5 items.
- Closure properties and decision problems of dag automata (Q1041757) (← links)
- Decidability and complexity analysis by basic paramodulation (Q1281494) (← links)
- Complexity of decision problems on totally rigid acyclic tree grammars (Q1622974) (← links)
- Semi-tensor product of matrices approach to reachability of finite automata with application to language recognition (Q1633055) (← links)
- Algebraic state space approach to model and control combined automata (Q1712571) (← links)