Une généralisation des ensembles de Dyck

DOI10.1007/BF02771689MaRDI QIDQ2545845zbMATH OpenFDO

Authors Y. Cochet, M. Nivat

Publication date 1971

Published in Israel Journal of Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF02771689

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Cites work

• Deterministic context free languages
• Transductions des langages de Chomsky

Cited in

(30)

• The equivalence and inclusion problems for NTS languages
• NTS languages are deterministic and congruential
• On the regular equivalence problem for regular Thue systems
• Monoids with disjunctive identity and their codes
• Thue systems as rewriting systems
• The word problem for free partially commutative groups
• A note on regular classes in special Thue systems
• An efficient algorithm to decide whether a monoid presented by a regular Church-Rosser Thue system is a group
• NTS grammars and Church-Rosser systems
• Testing for the Church-Rosser property
• Monadic Thue systems
• When is a monoid a group? The Church-Rosser case is tractable
• Classes of formal grammars
• A short scientific biography of Maurice Nivat
• Infinite regular Thue systems
• 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 3861446 (Why is no real title available?)
• When Church-Rosser becomes context free
• Elements of Finite Order for Finite Monadic Church-Rosser Thue Systems
• A note on thue systems with a single defining relation
• Commutativity in groups presented by finite Church-Rosser Thue systems
• scientific article; zbMATH DE number 3786151 (Why is no real title available?)
• A note on special thue systems with a single defining relation
• Groups and NTS languages
• Decidable sentences of Church-Rosser congruences
• On regularity of context-free languages
• Insertion languages
• The undecidability of the preperfectness of Thue systems
• A shorter proof that palindromes are not a Church-Rosser language, with extensions to almost-confluent and preperfect Thue systems
• Some decision problems about controlled rewriting 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)