Pages that link to "Item:Q1575908"

The following pages link to Intractability of decision problems for finite-memory automata (Q1575908):

Displayed 10 items.

• Parametrized automata simulation and application to service composition (Q485834) ‎ (← links)
• On notions of regularity for data languages (Q846359) ‎ (← links)
• An algebraic characterization of deterministic regular languages over infinite alphabets. (Q1426447) ‎ (← links)
• Problems on finite automata and the exponential time hypothesis (Q1662614) ‎ (← links)
• The containment problem for unambiguous register automata and unambiguous timed automata (Q2048204) ‎ (← links)
• Nondeterministic and co-nondeterministic implies deterministic, for data languages (Q2233422) ‎ (← links)
• Regular expressions for data words (Q2353403) ‎ (← links)
• Reachability in pushdown register automata (Q2396722) ‎ (← links)
• (Q5005176) ‎ (← links)
• Optimal run problem for weighted register automata (Q5919052) ‎ (← links)