Pages that link to "Item:Q2203588"
From MaRDI portal
The following pages link to Lengths of words accepted by nondeterministic finite automata (Q2203588):
Displaying 7 items.
- Intersection non-emptiness and hardness within polynomial time (Q1622971) (← links)
- Two-dimensional pattern matching against local and regular-like picture languages (Q2029490) (← links)
- Wheeler languages (Q2051845) (← links)
- VC-dimensions of nondeterministic finite automata for words of equal length (Q2075374) (← links)
- The Length of Subset Reachability in Nondeterministic Automata (Q4982094) (← links)
- Complexity of Searching for 2 by 2 Submatrices in Boolean Matrices (Q5041266) (← links)
- The NFA acceptance hypothesis: non-combinatorial and dynamic lower bounds (Q6633271) (← links)