scientific article; zbMATH DE number 4014693
From MaRDI portal
zbMATH Open0625.03023MaRDI QIDQ3026992FDOQ3026992
Authors: Craig C. Squier, Friedrich Otto 
Publication date: 1987
Title of this publication is not available (Why is that?)
Recommendations
- A finiteness condition for rewriting systems
- Church-Rooser property and homology of monoids
- On deciding whether a monoid is a free monoid or is a group
- About the descriptive power of certain classes of finite string-rewriting systems
- Constructing finitely presented monoids which have no finite complete presentation
Thue and Post systems, etc. (03D03) Free semigroups, generators and relations, word problems (20M05) Word problems, etc. in computability and recursion theory (03D40)
Cited In (25)
- Complete rewriting systems and homology of monoid algebras
- A decidable word problem without equivalent canonical term rewriting system
- The monadic theory of finite representations of infinite words
- Word problems and a homological finiteness condition for monoids
- Ends for subsemigroups of finite index.
- Pseudo-natural algorithms for the word problem for finitely presented monoids and groups
- Complexity, combinatorial group theory and the language of palutators
- Title not available (Why is that?)
- A finiteness condition for rewriting systems
- Characterizing the normal forms of a finitely presented monoid
- Church-Rooser property and homology of monoids
- A new finiteness condition for monoids presented by complete rewriting systems (after Craig C. Squier)
- Decidability problem for exponential equations in finitely presented groups
- Constructing finitely presented monoids which have no finite complete presentation
- On deciding whether a monoid is a free monoid or is a group
- New undecidability results for finitely presented monoids
- Finite complete rewriting systems and the complexity of word problem
- Cross-sections for finitely presented monoids with decidable word problems
- About the descriptive power of certain classes of finite string-rewriting systems
- Context-free rewriting systems and word-hyperbolic structures with uniqueness
- Finite Monoids: From Word to Circuit Evaluation
- FDT is undecidable for finitely presented monoids with solvable word problems
- Conditional semi-Thue systems for presenting monoids
- A finitely presented monoid which has solvable word problem but has no regular complete presentation
- A rewriting coherence theorem with applications in homotopy type theory
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 Q3026992)
