Pages that link to "Item:Q1662614"

The following pages link to Problems on finite automata and the exponential time hypothesis (Q1662614):

Displaying 10 items.

• Deciding path size of nondeterministic (and input-driven) pushdown automata (Q2098178) (← links)
• Approximate NFA universality motivated by information theory (Q2112188) (← links)
• On minimizing regular expressions without Kleene star (Q2140503) (← links)
• Learning from positive and negative examples: dichotomies and parameterized algorithms (Q2169975) (← links)
• Constrained synchronization and commutativity (Q2235741) (← links)
• On the Fine Grained Complexity of Finite Automata Non-emptiness of Intersection (Q5041250) (← links)
• Synchronizing words and monoid factorization, yielding a new parameterized complexity class? (Q5048011) (← links)
• (Q5089244) (← links)
• Semicomputable points in Euclidean spaces (Q5092426) (← links)
• Approximate NFA universality and related problems motivated by information theory (Q6093572) (← links)