Cited in
(30)- The undecidability of the preperfectness of Thue systems
- A note on regular classes in special Thue systems
- Thue systems as rewriting systems
- Classes of formal grammars
- A short scientific biography of Maurice Nivat
- Insertion languages
- A shorter proof that palindromes are not a Church-Rosser language, with extensions to almost-confluent and preperfect Thue systems
- scientific article; zbMATH DE number 3861446 (Why is no real title available?)
- Elements of Finite Order for Finite Monadic Church-Rosser Thue Systems
- Commutativity in groups presented by finite Church-Rosser Thue systems
- The word problem for free partially commutative groups
- Groups and NTS languages
- Decidable sentences of Church-Rosser congruences
- NTS languages are deterministic and congruential
- When Church-Rosser becomes context free
- On regularity of context-free languages
- Testing for the Church-Rosser property
- Monadic Thue systems
- When is a monoid a group? The Church-Rosser case is tractable
- Deux applications de la représentation matricielle d'une série rationnelle non commutative. (Two applications of matrix representations of a rational non -commutative series)
- scientific article; zbMATH DE number 3786151 (Why is no real title available?)
- A note on special thue systems with a single defining relation
- Infinite regular Thue systems
- A note on thue systems with a single defining relation
- Some decision problems about controlled rewriting systems
- The equivalence and inclusion problems for NTS languages
- An efficient algorithm to decide whether a monoid presented by a regular Church-Rosser Thue system is a group
- Monoids with disjunctive identity and their codes
- On the regular equivalence problem for regular Thue systems
- NTS grammars and Church-Rosser systems
This page was built for publication: Une généralisation des ensembles de Dyck
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2545845)
