Pages that link to "Item:Q896686"
From MaRDI portal
The following pages link to Operational state complexity of unary NFAs with finite nondeterminism (Q896686):
Displaying 7 items.
- A general approach to state complexity of operations: formalization and limitations (Q1622968) (← links)
- Operational state complexity of nested word automata (Q2271464) (← links)
- State complexity of permutation on finite languages over a binary alphabet (Q2358683) (← links)
- (Q4412108) (← links)
- (Q4964021) (← links)
- From Parallelism to Nonuniversality: An Unconventional Trajectory (Q5861784) (← links)
- Left is Better Than Right for Reducing Nondeterminism of NFAs (Q6114834) (← links)