Pages that link to "Item:Q2271436"

The following pages link to On the limits of the communication complexity technique for proving lower bounds on the size of minimal NFA's (Q2271436):

Displaying 3 items.

• Limitations of lower bound methods for deterministic nested word automata (Q553328) (← links)
• Descriptional complexity of regular languages (Q2074214) (← links)
• Lifting query complexity to time-space complexity for two-way finite automata (Q6141040) (← links)