Pages that link to "Item:Q1575908"

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

Displaying 21 items.

• Parametrized automata simulation and application to service composition (Q485834) (← links)
• On notions of regularity for data languages (Q846359) (← links)
• Decision problems for Turing machines (Q990079) (← links)
• An algebraic characterization of deterministic regular languages over infinite alphabets. (Q1426447) (← links)
• Computational complexity of decision problems on self-verifying finite automata (Q1622990) (← links)
• Problems on finite automata and the exponential time hypothesis (Q1662614) (← links)
• Exact complexity of problems of incompletely specified automata (Q1817068) (← 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)
• Complexity results on register context-free grammars and related formalisms (Q2672616) (← links)
• Decision Problems for Finite Automata over Infinite Algebraic Structures (Q2830202) (← links)
• Polynomial-time equivalence testing for deterministic fresh-register automata (Q5005176) (← links)
• The Containment Problem for Unambiguous Register Automata (Q5090504) (← links)
• Fundamentals of Computation Theory (Q5492918) (← links)
• (Q5797034) (← links)
• Optimal run problem for weighted register automata (Q5919052) (← links)
• A taxonomy and reductions for common register automata formalisms (Q6045033) (← links)
• $$\textsc {Reach}$$ on Register Automata via History Independence (Q6487290) (← links)
• Automata and grammars for data words (Q6666782) (← links)