Pages that link to "Item:Q1776398"

The following pages link to The Church-Rosser languages are the deterministic variants of the growing context-sensitive languages (Q1776398):

Displaying 26 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)
• Growing context-sensitive languages and Church-Rosser languages (Q1383712) (← links)
• The chop of languages (Q2358686) (← links)
• Lower bound technique for length-reducing automata (Q2381504) (← links)
• The size of Higman-Haines sets (Q2465049) (← links)
• ON STATELESS TWO-PUSHDOWN AUTOMATA AND RESTARTING AUTOMATA (Q3056279) (← links)
• Nondeterministic Ordered Restarting Automata (Q3177341) (← links)
• WHEN CHURCH-ROSSER BECOMES CONTEXT FREE (Q3401476) (← links)
• On Stateless Deterministic Restarting Automata (Q3599085) (← links)
• (Q5016364) (← links)
• On restarting automata with auxiliary symbols and small window size (Q5021113) (← links)
• Two-Sided Strictly Locally Testable Languages (Q5164867) (← links)
• A Complete Taxonomy of Restarting Automata without Auxiliary Symbols* (Q5164869) (← links)
• Left-to-right regular languages and two-way restarting automata (Q5321782) (← links)
• (Q5867516) (← links)
• (Q5867524) (← links)
• Input-Driven Double-Head Pushdown Automata (Q6114870) (← links)
• A hierarchy of jumping restarting automata (Q6180004) (← links)