Pages that link to "Item:Q3798271"
From MaRDI portal
The following pages link to Church-Rosser Thue systems and formal languages (Q3798271):
Displaying 50 items.
- On CD-systems of stateless deterministic R-automata with window size one (Q439938) (← links)
- Restarting transducers, regular languages, and rational relations (Q493655) (← links)
- Complexity of multi-head finite automata: origins and directions (Q616495) (← links)
- Computing by observing: simple systems and simple observers (Q616498) (← links)
- A hierarchy of monotone deterministic non-forgetting restarting automata (Q633765) (← links)
- Star-free languages are Church-Rosser congruential (Q714818) (← links)
- Toward a theory of input-driven locally parsable languages (Q728273) (← 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)
- Restarting automata with restricted utilization of auxiliary symbols (Q860860) (← 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)
- Thue systems as rewriting systems (Q1099642) (← links)
- Church-Rosser controlled rewriting systems and equivalence problems for deterministic context-free languages (Q1120292) (← links)
- Growing context-sensitive languages and Church-Rosser languages (Q1383712) (← links)
- McNaughton families of languages. (Q1401181) (← links)
- The context-splittable normal form for Church-Rosser language systems. (Q1401938) (← links)
- Parikh-reducing Church-Rosser representations for some classes of regular languages (Q1676318) (← links)
- The Church-Rosser languages are the deterministic variants of the growing context-sensitive languages (Q1776398) (← links)
- Weighted restarting automata (Q1797778) (← links)
- On the expressive power of stateless ordered restart-delete automata (Q2230720) (← links)
- Lambda-confluence for context rewriting systems (Q2344748) (← 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)
- Learning deterministic context free grammars: the Omphalos competition (Q2384127) (← links)
- LARS: a learning algorithm for rewriting systems (Q2384128) (← links)
- Deterministic pushdown-CD-systems of stateless deterministic R(1)-automata (Q2391861) (← links)
- The size of Higman-Haines sets (Q2465049) (← links)
- Context-free languages can be accepted with absolutely no space overhead (Q2581536) (← links)
- On the computational capacity of parallel communicating finite automata (Q2909225) (← links)
- Locally Chain-Parsable Languages (Q2946332) (← links)
- Hierarchies of weakly monotone restarting automata (Q3025320) (← links)
- On CD-Systems of Stateless Deterministic Two-Phase RR(1)-Automata (Q3166947) (← links)
- Nondeterministic Ordered Restarting Automata (Q3177341) (← links)
- A Characterization of the Context-Free Languages by Stateless Ordered Restart-Delete Automata (Q3297753) (← links)
- WHEN CHURCH-ROSSER BECOMES CONTEXT FREE (Q3401476) (← links)
- SHRINKING RESTARTING AUTOMATA (Q3434280) (← links)
- On the Computational Capacity of Parallel Communicating Finite Automata (Q3533006) (← links)
- (Q4988164) (← links)
- (Q5016364) (← links)
- On restarting automata with auxiliary symbols and small window size (Q5021113) (← links)
- Queue Automata: Foundations and Developments (Q5112182) (← links)
- Two-Sided Strictly Locally Testable Languages (Q5164867) (← links)
- A Complete Taxonomy of Restarting Automata without Auxiliary Symbols* (Q5164869) (← links)
- On Restarting Automata with Window Size One (Q5200077) (← links)
- Diving into the queue (Q5223609) (← links)
- Left-to-right regular languages and two-way restarting automata (Q5321782) (← links)
- (Q5867516) (← links)