scientific article; zbMATH DE number 3528212
From MaRDI portal
Publication:4105657
zbMath0338.02018MaRDI QIDQ4105657
Publication date: 1973
Full work available at URL: http://www.numdam.org/item?id=SD_1971-1972__25_1_A7_0
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Formal languages and automata (68Q45) Decidability of theories and sets of sentences (03B25) Thue and Post systems, etc. (03D03)
Related Items
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, Algebraic coherent confluence and higher globular Kleene algebras, 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, Decidable sentences of Church-Rosser congruences, Church-Rosser controlled rewriting systems and equivalence problems for deterministic context-free languages, Shuffle polygraphic resolutions for operads, Some decision problems about controlled rewriting systems, NTS grammars and Church-Rosser systems, Testing for the Church-Rosser property, Monadic Thue systems, From Analytical Mechanics Problems to Rewriting Theory Through M. Janet’s Work, Elements of Finite Order for Finite Monadic Church-Rosser Thue Systems, On weakly confluent monadic string-rewriting systems, Some properties of finite special string-rewriting systems, Calcul de longueurs de chaînes de réécriture dans le monoïde libre, Convergent presentations and polygraphic resolutions of associative algebras, Contributions of Ronald V. Book to the theory of string-rewriting systems, Finite complete rewriting systems for the Jantzen monoid and the Greendlinger group, Cancellativity in finitely presented semigroups, A note on special thue systems with a single defining relation, Variable-length codes independent or closed with respect to edit relations, An \(O(| T| ^ 3)\) algorithm for testing the Church-Rosser property of Thue systems, Homogeneous Thue systems and the Church-Rosser property, Confluence problems for trace rewriting systems, The Church-Rosser property and special Thue systems, Pseudo-natural algorithms for the word problem for finitely presented monoids and groups, Confluence of algebraic rewriting systems
