Abstract
We study the computational complexity of solving equations and of determining the satisfiability of programs over a fixed finite monoid. We partially answer an open problem of [4] by exhibiting quasi-polynomial time algorithms for a subclass of solvable non-nilpotent groups and relate this question to a natural circuit complexity conjecture. In the special case when M is aperiodic, we show that PROGRAM SATISFIABILITY is in P when the monoid belongs to the variety DA and is NP-complete otherwise. In contrast, we give an example of an aperiodic outside DA for which EQUATION SATISFIABILITY is computable in polynomial time and discuss the relative complexity of the two problems. We also study the closure properties of classes for which these problems belong to P and the extent to which these fail to form algebraic varieties.
P. McKenzie, P. Tesson and D. Thérien are supported by NSERC and FCAR grants. A part of the work was completed during workshops held respectively by DIMACS-DIMATIA (June 99) and McGill University (February 00). The authors wish to thank the organizers of both events.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
D. A. Barrington. Bounded-width polynomial-size branching programs recognize exactly those languages in NC1. J. Comput. Syst. Sci., 38(1):150–164, Feb. 1989.
D. A. M. Barrington, H. Straubing, and D. Thérien. Non-uniform automata over groups. Information and Computation, 89(2):109–132, Dec. 1990.
S. Eilenberg. Automata, Languages and Machines. Academic Press, 1976.
M. Goldmann and A. Russell. The complexity of solving equations over finite groups. In Proceedings of the 14th Annual IEEE Conference on Computational Complexity (CCC-99), pages 80–86, 1999.
P. McKenzie, P. Péladeau, and D. Thérien. NC1: The automata theoretic viewpoint. Computational Complexity, 1:330–359, 1991.
P. Péladeau and D. Thérien. Sur les langages reconnus par des groupes nilpotents. Compte-rendus de l’Académie des Sciences de Paris, pages 93–95, 1988.
J.-É. Pin, H. Straubing, and D. Thérien. Locally trivial categories and unambiguous concatenation. J. Pure Applied Algebra, 52:297–311, 1988.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Barrington, D.M., McKenzie, P., Moore, C., Tesson, P., Thérien, D. (2000). Equation Satisfiability and Program Satisfiability for Finite Monoids. In: Nielsen, M., Rovan, B. (eds) Mathematical Foundations of Computer Science 2000. MFCS 2000. Lecture Notes in Computer Science, vol 1893. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44612-5_13
Download citation
DOI: https://doi.org/10.1007/3-540-44612-5_13
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67901-1
Online ISBN: 978-3-540-44612-5
eBook Packages: Springer Book Archive