Pages that link to "Item:Q1383712"

The following pages link to Growing context-sensitive languages and Church-Rosser languages (Q1383712):

Displaying 15 items.

• Weighted restarting automata and pushdown relations (Q287429) (← links)
• Restarting transducers, regular languages, and rational relations (Q493655) (← links)
• On state-alternating context-free grammars (Q557822) (← links)
• On stateless deterministic restarting automata (Q611046) (← links)
• Complexity of multi-head finite automata: origins and directions (Q616495) (← links)
• A hierarchy of monotone deterministic non-forgetting restarting automata (Q633765) (← links)
• The degree of word-expansion of lexicalized RRWW-automata - A new measure for the degree of nondeterminism of (context-free) languages (Q840776) (← 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)
• On the complexity of 2-monotone restarting automata (Q927391) (← links)
• On determinism versus nondeterminism for restarting automata (Q948093) (← links)
• Small overlap monoids. II: Automatic structures and normal forms. (Q1024392) (← links)
• Two-dimensional hierarchies of proper languages of lexicalized FRR-automata (Q1041046) (← links)
• The Church-Rosser languages are the deterministic variants of the growing context-sensitive languages (Q1776398) (← links)
• ON A GENERALIZATION OF DEHN'S ALGORITHM (Q3606403) (← links)