The following pages link to (Q3292017):
Displaying 4 items.
- Membership for growing context-sensitive grammars is polynomial (Q579948) (← links)
- On-line computer recognition of proposed standard ANSI(USASI) handprinted characters (Q1251088) (← links)
- Strongly Regular Grammars and Regular Approximation of Context-Free Languages (Q3637226) (← links)
- Non-Self-Embedding Grammars and Descriptional Complexity (Q5164870) (← links)
