The following pages link to (Q4544433):
Displaying 15 items.
- The complexity of intersecting finite automata having few final states (Q347114) (← links)
- Parameterized complexity and approximability of the longest compatible sequence problem (Q456697) (← links)
- Problems on finite automata and the exponential time hypothesis (Q1662614) (← links)
- The Turing way to parameterized complexity (Q1877697) (← links)
- A multi-parameter analysis of hard problems on deterministic finite automata (Q2256724) (← links)
- A parametric analysis of the state-explosion problem in model checking (Q2495399) (← links)
- Problems on Finite Automata and the Exponential Time Hypothesis (Q2830210) (← links)
- Parameterized complexity of basic decision problems for tree automata (Q2855747) (← links)
- Fixed Structure Complexity (Q3503576) (← links)
- Parameterized Complexity and Approximability of the SLCS Problem (Q3503583) (← links)
- Synchronizing series-parallel deterministic finite automata with loops and related problems (Q5021111) (← 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)
- On the Complexity of Bounded Context Switching. (Q5111714) (← links)
- Fine-grained complexity of safety verification (Q5919003) (← links)