Systems of reductions
zbMath0636.68027MaRDI QIDQ1098283
S. Kemmerich, Benjamin Benninghofen, Michael M. Richter
Publication date: 1987
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
word problemcompletionterm-rewriting systemsreductionsfinite termination propertyfinitely presented monoidsThue systemsChurch-Rosser propertyNoetherian systemsconfluencyKnuth- Bendix algorithmundecidable problems in general algebras
Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Abstract data types; algebraic specification (68Q65) Decidability of theories and sets of sentences (03B25) Semigroups in automata theory, linguistics, etc. (20M35) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Computability and recursion theory on ordinals, admissible sets, etc. (03D60) Word problems (aspects of algebraic structures) (08A50)
Related Items