Pages that link to "Item:Q1383712"
From MaRDI portal
The following pages link to Growing context-sensitive languages and Church-Rosser languages (Q1383712):
Displaying 45 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)
- McNaughton families of languages. (Q1401181) (← links)
- The context-splittable normal form for Church-Rosser language systems. (Q1401938) (← links)
- The Church-Rosser languages are the deterministic variants of the growing context-sensitive languages (Q1776398) (← links)
- On the expressive power of stateless ordered restart-delete automata (Q2230720) (← links)
- The chop of languages (Q2358686) (← links)
- Regulated variants of limited context restarting automata (Q2358691) (← links)
- Lower bound technique for length-reducing automata (Q2381504) (← links)
- The size of Higman-Haines sets (Q2465049) (← links)
- Asynchronous Parallel Communicating Systems of Pushdown Automata (Q2949728) (← links)
- ON STATELESS TWO-PUSHDOWN AUTOMATA AND RESTARTING AUTOMATA (Q3056279) (← links)
- A Characterization of the Context-Free Languages by Stateless Ordered Restart-Delete Automata (Q3297753) (← links)
- Linear automata with translucent letters and linear context-free trace languages (Q3298123) (← links)
- WHEN CHURCH-ROSSER BECOMES CONTEXT FREE (Q3401476) (← links)
- SHRINKING RESTARTING AUTOMATA (Q3434280) (← links)
- On Alternating Phrase-Structure Grammars (Q3540130) (← links)
- On Stateless Deterministic Restarting Automata (Q3599085) (← links)
- ON A GENERALIZATION OF DEHN'S ALGORITHM (Q3606403) (← links)
- (Q5016364) (← links)
- On restarting automata with auxiliary symbols and small window size (Q5021113) (← links)
- Queue Automata: Foundations and Developments (Q5112182) (← links)
- A Complete Taxonomy of Restarting Automata without Auxiliary Symbols* (Q5164869) (← links)
- ON ALTERNATING PHRASE-STRUCTURE GRAMMARS (Q5187849) (← links)
- On Restarting Automata with Window Size One (Q5200077) (← links)
- Diving into the queue (Q5223609) (← links)
- Automata with cyclic move operations for picture languages (Q5223618) (← links)
- Left-to-right regular languages and two-way restarting automata (Q5321782) (← links)
- (Q5867516) (← links)
- Knapsack in hyperbolic groups (Q5919299) (← links)
- On deterministic ordered restart-delete automata (Q5919676) (← links)
- Input-Driven Double-Head Pushdown Automata (Q6114870) (← links)
- A hierarchy of jumping restarting automata (Q6180004) (← links)
- Non-returning deterministic and nondeterministic finite automata with translucent letters (Q6186539) (← links)
