scientific article; zbMATH DE number 3528212

MaRDI QIDQ4105657zbMATH OpenFDO

Authors M. Nivat

Publication date 1973

Full work available at URL http://www.numdam.org/item?id=SD_1971-1972__25_1_A7_0, https://eudml.org/doc/111433

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Thue and Post systems, etc. (03D03) Formal languages and automata (68Q45)

Cited in

(34)

• An \(O(| T| ^ 3)\) algorithm for testing the Church-Rosser property of Thue systems
• The Church-Rosser property and special Thue systems
• Pseudo-natural algorithms for the word problem for finitely presented monoids and groups
• Reductions in tree replacement systems
• The equivalence and inclusion problems for NTS languages
• On the regular equivalence problem for regular Thue systems
• Special monoids and special Thue systems
• The problems of cyclic equality and conjugacy for finite complete rewriting systems
• Word problems and a homological finiteness condition for monoids
• The word problem for free partially commutative groups
• Pseudo-natural algorithms for finitely generated presentations of monoids and groups
• Church-Rosser controlled rewriting systems and equivalence problems for deterministic context-free languages
• NTS grammars and Church-Rosser systems
• Testing for the Church-Rosser property
• Monadic Thue systems
• Some properties of finite special string-rewriting systems
• Contributions of Ronald V. Book to the theory of string-rewriting systems
• Cancellativity in finitely presented semigroups
• Confluence problems for trace rewriting systems
• Variable-length codes independent or closed with respect to edit relations
• Calcul de longueurs de chaînes de réécriture dans le monoïde libre
• Convergent presentations and polygraphic resolutions of associative algebras
• From Analytical Mechanics Problems to Rewriting Theory Through M. Janet’s Work
• Elements of Finite Order for Finite Monadic Church-Rosser Thue Systems
• A note on special thue systems with a single defining relation
• Algebraic coherent confluence and higher globular Kleene algebras
• Confluence of algebraic rewriting systems
• Decidable sentences of Church-Rosser congruences
• Shuffle polygraphic resolutions for operads
• Completion in operads via essential syzygies
• On weakly confluent monadic string-rewriting systems
• Finite complete rewriting systems for the Jantzen monoid and the Greendlinger group
• Homogeneous Thue systems and the Church-Rosser property
• Some decision problems about controlled rewriting systems

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4105657)