Pages that link to "Item:Q1776398"
From MaRDI portal
The following pages link to The Church-Rosser languages are the deterministic variants of the growing context-sensitive languages (Q1776398):
Displaying 9 items.
- On stateless deterministic restarting automata (Q611046) (← links)
- A hierarchy of monotone deterministic non-forgetting restarting automata (Q633765) (← links)
- Star-free languages are Church-Rosser congruential (Q714818) (← links)
- 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)
- Degrees of non-monotonicity for restarting automata (Q861249) (← links)
- A survey on the local divisor technique (Q896673) (← links)
- On the complexity of 2-monotone restarting automata (Q927391) (← links)
- On determinism versus nondeterminism for restarting automata (Q948093) (← links)
