Finite monoids: From word to circuit evaluation

SIAM Journal on Computing

Volumn 26, Issue 1, 1997, Pages 138-152

  Beaudry, Martin ^a   Mckenzie, Pierre ^b   Péladeau, Pierre ^c,d   Thérien, Denis ^e  

^a UNIVERSITÉ DE SHERBROOKE   (Canada)

^b UNIVERSITÉ DE MONTRÉAL   (Canada)

^c UNIVERSITÉ PIERRE ET MARIE CURIE   (France)

^d Booz Allen and Hamilton   (France)

^e MCGILL UNIVERSITY   (Canada)

Author keywords

Automata and formal languages; Complexity theory; Monoids

Indexed keywords

EID: 0039863526     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539793249530     Document Type: Review

References (37)

1. C. ÀLVAREZ AND B. JENNER, A very hard log space counting class, in Theoret. Comput. Sci., 107 (1993), pp. 3-30.
2. L. BABAI, E. LUKS, AND A. SERESS, Permutation groups in NC, in Proc. 19th ACM Symposium on the Theory of Computing, Association for Computing Machinery, New York, 1987, pp. 409-420.
3. J. L. BALCÁZAR, J. DÍAZ, AND J. GABARRÓ, Structural Complexity I and II, Springer-Verlag, Berlin, New York, Heidelberg, 1988 and 1990.
4. 1, J. Comput. System Sci., 38 (1989), pp. 150-164.
5. 1, J. Comput. System Sci., 41 (1990), pp. 274-306.
6. D. A. BARRINGTON, H. STRAUBING, AND D. THÉRIEN, Non-uniform automata over groups, Inform. Comput., 89 (1990), pp. 109-132.
7. 1, J. Assoc. Comput. Mach., 35 (1988), pp. 941-952.
8. M. BEAUDRY, Membership testing in commutative transformation semigroups, Inform. and Comput., 79 (1988), pp. 84-93.
9. M. BEAUDRY, Membership testing in threshold one transformation monoids, Inform. and Comput., 113 (1994), pp. 1-25.
10. M. BEAUDRY AND P. MCKENZIE, Circuits, matrices, and nonassociative computation, in J. Comput. System Sci., 50 (1995), pp. 441-455.
11. M. BEAUDRY, P. MCKENZIE, AND P. PÉLADEAU, Circuits with monoidal gates, in Proc. 10th Symposium on Theoretical Aspects of Computer Science, Lecture Notes in Comput. Sci. 665, Springer-Verlag, Berlin, New York, Heidelberg, 1993, pp. 555-565.
12. M. BEAUDRY, P. MCKENZIE, AND D. THÉRIEN, The membership problem in aperiodic transformation monoids, J. Assoc., Comput. Mach., 39 (1992), pp. 599-616.
13. R. BEIGEL, J. GILL, AND U. HERTRAMPF, Counting classes: Thresholds, parity, mods, and fewness, in Proc. 7th Symposium on Theoretical Aspects of Computer Science, Lecture Notes in Comput. Sci. 415, Springer-Verlag, Berlin, New York, Heidelberg, 1990, pp. 49-57.
14. F. BÉDARD, F. LEMIEUX, AND P. MCKENZIE, Extensions to Barrington's M-program model, Theoret. Comput. Sci., 107 (1993), pp. 31-61.
15. G. BERGMAN, Embedding arbitrary algebras into groups, Algebra Universalis, 25 (1988), pp. 107-120.
16. D. BOVET, P. CRESCENZI, AND R. SILVESTRI, Complexity classes and sparse oracles, in Proc. 6th IEEE Structure in Complexity Theory Conference, IEEE Computer Society Press, Los Alamitos, CA, 1991, pp. 102-108.
17. D. BOVET, P. CRESCENZI, AND R. SILVESTRI, A uniform approach to define complexity classes, Theoret. Comput. Sci., 104 (1992), pp. 263-283.
18. G. BUNTROCK, C. DAMM, U. HERTRAMPF, AND C. MEINEL, Structure and importance of logspace MOD-classes, Math. Systems Theory, 25 (1992), pp. 223-237.
19. S. R. BUSS, S. COOK, A. GUPTA, AND V. RAMACHANDRAN, An optimal parallel algorithm for formula evaluation, SIAM J. Comput., 21 (1992), pp. 755-780.
20. S. A. COOK, A taxonomy of problems with fast parallel solutions, Inform. and Comput., 64 (1985), pp. 2-22.
21. S. A. COOK, AND P. MCKENZIE, Problems complete for deterministic logarithmic space, J. Algorithms, 8 (1987), pp. 385-394.
22. S. EILENBERG, Automata, Languages and Machines, vol. B, Academic Press, New York, 1976.
23. U. HERTRAMPF, C. LAUTERMANN, T. SCHWENTICK, H. VOLLMER, AND K. WAGNER, On the power of polynomial time bit-reductions, in Proc. 8th IEEE Structure in Complexity Theory Conference, IEEE Computer Society Press, Los Alamitos, CA, 1993, pp. 200-207.
24. N. IMMERMAN, Nondeterministic space is closed under complementation, SIAM J. Comput., 17, 5 (1988), pp. 935-938.
25. B. JENNER, P. MCKENZIE, AND D. THÉRIEN, Logspace and logtime leaf languages, Inform. and Comput., 129 (1996), pp. 21-33.
26. D. KOZEN, Lower bounds for natural proof systems, in Proc. 18th ACM Symposium on the Theory of Computing, Association for Computing Machinery, New York, 1977, pp. 254-266.
27. R. E. LADNER, The circuit value problem is log-space complete for P, ACM SIGACT Newslett. 7 (1975), pp. 18-20.
28. 1: The automata-theoretic viewpoint, Comput. Complexity, 1 (1991), pp. 330-359.
29. J.-E. PIN, Variétés de langages formels, Masson, Paris, 1984 (in French); Varieties of Formal Languages, Plenum Press, New York, 1986 (in English).
30. J.-E. PIN, Variétés de langages formels, Masson, Paris, 1984 (in French); Varieties of Formal Languages, Plenum Press, New York, 1986 (in English).
31. W. RUZZO, On uniform circuit complexity, J. Comput. System Sci., 22 (1981), pp. 365-383.
32. W. RUZZO, J. SIMON, AND M. TOMPA, Space-bounded hierarchies and probabilistic computations, J. Comput. System Sci., 28 (1984), pp. 216-230.
33. H. STRAUBING, Varieties of recognizable sets whose syntactic monoids contain solvable groups, Ph.D. thesis, University of California at Berkeley, Berkeley, CA, 1978.
34. H. STRAUBING, The variety generated by finite nilpotent monoids, Semigroup Forum, 24 (1982), pp. 25-38.
35. R. SZELEPCSÉNYI, The method of forcing for nondeterministic automata, Bull. European Assoc. Theoret. Comput. Sci., 33 (1987), pp. 96-100.
36. D. THÉRIEN, Classification of finite monoids: The language approach, Theoretical Comput. Sci., 14 (1981), pp. 195-208.
37. D. THÉRIEN, Subword counting and nilpotent groups, in Combinatorics on Words: Progress and Perspectives, L. J. Cummings, ed., Academic Press, New York, 1983, pp. 297-305.