Pages that link to "Item:Q2855747"

The following pages link to Parameterized complexity of basic decision problems for tree automata (Q2855747):

Displaying 2 items.

• 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)