A characterisation of deterministic context-free languages by means of right-congruences
From MaRDI portal
Publication:913524
DOI10.1016/0304-3975(90)90123-YzbMath0699.68099MaRDI QIDQ913524
Publication date: 1990
Published in: Theoretical Computer Science (Search for Journal in Brave)
Related Items
Some decision problems about controlled rewriting systems, A polynomial algorithm testing partial confluence of basic semi-Thue systems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Some decision problems about controlled rewriting systems
- Fundamental properties of infinite trees
- The equivalence and inclusion problems for NTS languages
- Thue systems as rewriting systems
- Church-Rosser controlled rewriting systems and equivalence problems for deterministic context-free languages
- Monadic Thue systems
- Infinite regular Thue systems
- Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
- On jump-deterministic pushdown automata
- A Note on Pushdown Store Automata and Regular Systems