scientific article
From MaRDI portal
Publication:3994922
zbMath1097.68572MaRDI QIDQ3994922
Publication date: 23 January 1993
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Grammars and rewriting systems (68Q42)
Related Items (33)
Notes on equational theories of relations ⋮ Decidability of confluence and termination of monadic term rewriting systems ⋮ A complete characterization of termination of 0p 1q→1r 0s ⋮ On the word problem for special monoids ⋮ The problem of deciding confluence on a given congruence class is tractable for finite special string-rewriting systems ⋮ The isomorphism problem for finite extensions of free groups is in PSPACE ⋮ On confluence of one-rule trace-rewriting systems ⋮ Compositions with superlinear deterministic top-down tree transformations ⋮ Conditional semi-Thue systems for presenting monoids ⋮ MULTIPLICATION TABLES AND WORD-HYPERBOLICITY IN FREE PRODUCTS OF SEMIGROUPS, MONOIDS AND GROUPS ⋮ On the word problem for weakly compressible monoids ⋮ Confluence of one-rule Thue systems ⋮ The context-splittable normal form for Church-Rosser language systems. ⋮ On the word problem for free products of semigroups and monoids ⋮ About the descriptive power of certain classes of finite string-rewriting systems ⋮ Decision problems for finite special string-rewriting systems that are confluent on some congruence class ⋮ A logspace solution to the word and conjugacy problem of generalized Baumslag-Solitar groups ⋮ Some experiments with a completion theorem prover ⋮ A deterministic algorithm to decide if a finitely presented abelian monoid is cancellative ⋮ Note on compatible well orders on a free monoid ⋮ The word problem for one-relation monoids: a survey ⋮ Some undecidable termination problems for semi-Thue systems ⋮ Algebra and automated deduction ⋮ On weakly confluent monadic string-rewriting systems ⋮ Decision problems for semi-Thue systems with a few rules ⋮ Unnamed Item ⋮ On growing context-sensitive languages ⋮ Invariants and closures in the theory of rewrite systems ⋮ Non-Looping String Rewriting ⋮ On prefixal one-rule string rewrite systems ⋮ Homogeneous grammars with a reduced number of non-context-free products ⋮ Non-finitely generated maximal subgroups of context-free monoids ⋮ Confluence problems for trace rewriting systems
This page was built for publication:
