scientific article
From MaRDI portal
Publication:3677188
zbMath0563.68062MaRDI QIDQ3677188
Publication date: 1983
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Formal languages and automata (68Q45) Semigroups in automata theory, linguistics, etc. (20M35) Thue and Post systems, etc. (03D03)
Related Items
On the verifiability of two-party algebraic protocols, n-level rewriting systems, The problems of cyclic equality and conjugacy for finite complete rewriting systems, Monoids with disjunctive identity and their codes, On reduced thue systems, On the security of p-party protocols, On deciding the confluence of a finite string-rewriting system on a given congruence class, Word problems and a homological finiteness condition for monoids, Formal language theory and DNA: An analysis of the generative capacity of specific recombinant behaviors, Bi-infinitary codes, Some polynomial-time algorithms for finite monadic Church-Rosser Thue systems, A complete rewriting system for a monoid of tree transformation classes, Commutativity in groups presented by finite Church-Rosser Thue systems, A complete description for a monoid of deterministic bottom-up tree transformation classes, On noncounting regular classes, Cancellation rules and extended word problems, Using string-rewriting for solving the word problem for finitely presented groups, Units of special Church-Rosser monoids, A note on a special one-rule semi-Thue system, Pseudo-natural algorithms for the word problem for finitely presented monoids and groups
