Satisfiability of systems of equations over finite monoids

DOI10.1007/3-540-44683-4_47MaRDI QIDQ4779171zbMATH OpenFDO

Authors Cristopher Moore, Pascal Tesson, Denis Thérien

Publication date 25 November 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2136/21360537

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Algebraic theory of languages and automata (68Q70) Symbolic computation and algebraic computation (68W30)

Recommendations

• Equation satisfiability and program satisfiability for finite monoids
• Dichotomies in the complexity of solving systems of equations over finite semigroups
• The complexity of solving equations over finite groups
• Computing and Combinatorics
• Solving a fixed number of equations over finite groups

Cited in

(14)

• A discrete homotopy theory for binary reflexive structures
• The complexity of solving equations over finite groups
• Inapproximability results for equations over finite groups
• Solving a fixed number of equations over finite groups
• The complexity of equivalence and isomorphism of systems of equations over finite groups
• Complexity issues of checking identities in finite monoids
• scientific article; zbMATH DE number 4058892 (Why is no real title available?)
• Equation satisfiability and program satisfiability for finite monoids
• Computing and Combinatorics
• scientific article; zbMATH DE number 2086612 (Why is no real title available?)
• Solving equation systems in ω-categorical algebras
• Alphabetical satisfiability problem for trace equations
• Mathematical Foundations of Computer Science 2004
• On complexity of solving of equations over graphs

This page was built for publication: Satisfiability of systems of equations over finite monoids

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4779171)