The following pages link to McNaughton families of languages. (Q1401181):
Displaying 9 items.
- Computing by observing: simple systems and simple observers (Q616498) (← links)
- Toward a theory of input-driven locally parsable languages (Q728273) (← links)
- The context-splittable normal form for Church-Rosser language systems. (Q1401938) (← links)
- Lambda-confluence for context rewriting systems (Q2344748) (← links)
- Regulated variants of limited context restarting automata (Q2358691) (← links)
- Lower bound technique for length-reducing automata (Q2381504) (← links)
- Locally Chain-Parsable Languages (Q2946332) (← links)
- DECIDABILITY AND COMPLEXITY IN AUTOMATIC MONOIDS (Q5462671) (← links)
- MULTIPLICATION TABLES AND WORD-HYPERBOLICITY IN FREE PRODUCTS OF SEMIGROUPS, MONOIDS AND GROUPS (Q6065367) (← links)
