The following pages link to (Q4941161):
Displaying 4 items.
- Probabilistic length-reducing two-pushdown automata (Q841617) (← links)
- A shorter proof that palindromes are not a Church-Rosser language, with extensions to almost-confluent and preperfect Thue systems (Q844899) (← links)
- The context-splittable normal form for Church-Rosser language systems. (Q1401938) (← links)
- Lower bound technique for length-reducing automata (Q2381504) (← links)