Undecidability, Automata, and Pseudovarities of Finite Semigroups

International Journal of Algebra and Computation

Volumn 9, Issue 3-4, 1999, Pages 455-473

  Rhodes, John ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0033438296     PISSN: 02181967     EISSN: None     Source Type: Journal    
DOI: 10.1142/s0218196799000278     Document Type: Article

References (35)

1. D. Albert, R. Baldinger and J. Rhodes, Undecidability of the identity problem for finite semigroups, J. Symbolic Logic 57 (1992), 179-192.
2. J. Almeida, Finite Semigroups and Universal Algebra, World Scientific, Singapore, 1994.
3. J. Almeida, Hyperdecidability, pseudovarieties and the calculation of semidirect products, CMUP 96-11, University of Porto, Portugal, 1996.
4. J. Almeida, A. Azevedo and M. Zeitoun, The pseudovariety J is hyper-decidable, CMUP 97-1, University of Porto, Portugal, 1997.
5. C. J. Ash, Inevitable graphs: A proof of the type II conjecture and some related decision procedures, Int. J. Algebra Comp. 1 (1991), 128-146.
6. B. Austin, K. Henckell, C. Nehaniv and J. Rhodes, Subsemigroups and complexity via the Presentation Lemma, J. Pure Appl. Algebra 101 (1995), 245-289.
7. J.-C. Birget and J. Rhodes, Almost finite expansions of arbitrary semigroups, J. Pure Appl. Algebra 32 (1984), 239-287.
8. S. Burris and H. P. Sankappanavar, A Course in Universal Algebra, Springer-Verlag, Berlin, 1981.
9. M. Delgado, On the hyper-decidability of pseudovarieties of groups, CMUP 97-3, University of Porto, Portugal, 1997.
10. S. Eilenberg, Automata, Languages and Machines, Vol. B, Academic Press, New York, 1976.
11. Y. Gurevich and H. R. Lewis, The word problem for cancellation semigroups with 0, J. Symbolic Logic 49 (1984), 184-191.
12. K. Henckell, Pointlike sets: The finest aperiodic cover of a finite semigroup, J. Pure Appl. Algebra 55 (1988), 85-126.
13. K. Henckell, S. Margolis, J.-E. Pin and J. Rhodes, Ash's Type II theorem, profinite topology and Mal'cev products, Int. J. Algebra Comput. 1 (1991), 411-436.
14. J. Karnofsky and J. Rhodes, Decidability of complexity one-half for finite semigroups, Semigroup Forum 24 (1982), 55-66.
15. O. G. Kharlampovich and M. V. Sapir, Algorithmic problems in varieties, Int. J. Algebra Comput. 5, 379-602.
16. K. Krohn and J. Rhodes, Algebraic theory of machines. I. Prime decomposition theorem for finite semigroups and machines, Trans. Amer. Math. Soc. 1160 (1965), 450-464.
17. K. Krohn, J. Rhodes and B. Tilson, Lectures on finite semigroups, Chaps. 1, 5-9 in Algebraic Theory of Machines, Languages and Semigroups, ed. M. Arbib, Academic Press, New York, 1968.
18. J. McCammond and J. Rhodes, Geometric semigroup theory, Centre for Pure and Applied Mathematics, University of California, Berkeley, CA 94720-3840, preprint (August 1997).
19. V. L. Murskiǐ, Some examples of varieties of semigroups, Matematicheskie Zametski 3 (1968), 663-670; Eng. Trans. Math. Notes 3 (1968), 423-427.
20. V. L. Murskiǐ, Some examples of varieties of semigroups, Matematicheskie Zametski 3 (1968), 663-670; Eng. Trans. Math. Notes 3 (1968), 423-427.
21. J.-E. Pin, Varieties of Formal Languages, Plenum, New York, 1986.
22. E. Post, Recursive unsolvability of a problem of Thue, J. Symbolic Logic 12 (1947), 1-11.
23. J. Reiterman, The Birkhoff problem for finite algebras, Algebra Universalis 14 (1982), 1-10.
24. J. Rhodes, Global structure theorems for arbitrary semigroups, in Proc. 1984 Marquette Conf. on Semigroups, eds. K. Byleen, P. Jones and F. Pastijn, unpublishal, printed informally by the Department of Mathematics Marquette University, 1984.
25. J. Rhodes, New techniques in global semigroup theory, in Semigroups and Their Applications, eds. S. Goberstein and P. Higgins, Reidel, Dordrecht, 1987, pp. 169-181.
26. J. Rhodes, Flows on Automata, Centre for Pure and Applied Mathematics, University of California, Berkeley, CA 94720-3840, pp. 1-79, preprint (1995).
27. J. Rhodes and B. Tilson, The kernel of monoid morphisms, J. Pure Appl. Algebra 62 (1989), 285-312.
28. J. Rhodes and B. Tilson, Two-sided complexity, unpublished manuscript, 1989.
29. J. Rhodes and P. Weil, Decomposition techniques for finite semigroups using categories, II, J. Pure Appl. Algebra 62 (1989), 269-284.
30. H. Rogers, Theory of Recursive Functions and Effective Computability, McGraw-Hill, New York, 1967.
31. G. E. Sacks, Saturated Model Theory, ed. W. A. Benjamin, Math Lecture Note Series, Reading, MA, 1972.
32. M. V. Sapir, Weak word problems for finite semigroups, Semigroups and Monoids with Applications, Proc. Berkeley Workshop on Monoids, ed. J. Rhodes, World Scientific, Singapore (1991), 206-219.
33. B. Steinberg, On pointlike sets and joins of pseudovarieties (plus addendum), Int. J. Algebra Comput. 8 (1998), 203-234.
34. B. Tilson, Categories as algebra: An essential ingredient in the theory of monoids, J. Pure Appl. Algebra 48 (1987), 83-198.
35. P. Weil, Implicit operations on pseudovarieties, an introduction, Semigroups and Monoids with Applications, Proc. Berkeley Workshop on Monoids, ed. J. Rhodes, World Scientific, Singapore (1991), 89-104.