The following pages link to (Q4199562):
Displaying 5 items.
- Concise description of finite languages (Q1157179) (← links)
- Boolean kernels of context-free languages (Q2117675) (← links)
- On reducing the number of stack symbols in a PDA (Q3141998) (← links)
- A framework for polynomial-time query learnability (Q4298370) (← links)
- On the undecidability and descriptional complexity of synchronized regular expressions (Q6171822) (← links)