A Delay Theorem for Pointlikes

Semigroup Forum

Volumn 63, Issue 3, 2001, Pages 281-304

  Steinberg, Benjamin ^a  

^a UNIVERSITY OF PORTO   (Portugal)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0009885388     PISSN: 00371912     EISSN: None     Source Type: Journal    
DOI: 10.1007/s002330010051     Document Type: Article

References (26)

1. Albert, D., R. Baldinger and J. Rhodes, Undecidability of the identity problem for finite semigroups, The Journal of Symb. Logic 57 (1992), 179-192.
2. Almeida, J., "Finite Semigroups and Universal Algebra", World Scientific, Singapore, 1994.
3. Almeida, J., Hyperdecidable pseudovarieties and the calculation of semidirect products, Internat. J. Algebra and Comput. 9 (1999), 241-261.
4. n, J. Pure Appl. Algebra 146 (1999), 1-15.
5. Almeida, J., and P. V. Silva, On the hyperdecidability of semidirect products of pseudovarieties, Comm. in Algebra 26 (1998) 4065-4077.
6. Almeida, J., and P. V. Silva, SC-hyperdecidability of R, Theor. Comp. Sci. (to appear, 2000).
7. Almeida, J., and P. Weil, Profinite categories and semidirect products, J. Pure Appl. Algebra 123 (1998) 1-50.
8. Almeida, J., and M. Zeitoun, The pseudovariety J is hyperdecidable, Theor. Inf. and Applications 31 (1997) 457-482.
9. Ash, C. J., Inevitable Graphs: A proof of the Type II conjecture and some related decision procedures, Internat. J. Algebra and Comput. 1 (1991) 127-146.
10. Brzozowski, J. A., and I. Simon, Characterizations of locally testable events, Discrete Math. 4 (1973) 243-271.
11. Eilenberg, S., "Automata, Languages and Machines", Academic Press, New York, Vol A, 1974: Vol B, 1976.
12. Henckell, K., Pointlike Sets: The finest aperiodic cover of a finite semigroup, J. Pure Appl. Algebra 55 (1988) 85-126.
13. Jones, P. R., Profinite categories, implicit operations, and pseudovarieties of categories, J. Pure Appl. Algebra 109 (1996) 61-95.
14. Jones, P. R., and M. B. Szendrei, Local varieties of completely regular monoids, J. Algebra 150 (1992) 1-27.
15. Knast, R., Some theorems on graph congruences, RAIRO Inform. Théor. 17 (1983) 331-342.
16. Krohn, K., and J. Rhodes, Algebraic theory of machines. I. Prime decomposition theorem for finite semigroups and machines. Trans. Amer. Math. Soc. 116 (1965) 450-464.
17. Rhodes, J., and B. Steinberg, Pointlike sets, hyperdecidability, and the identity problem for finite semigroups, Internat. J. Algebra and Comput. 9 (1999) 475-481.
18. Steinberg, B., Decidability and hyperdecidability of joins of pseudovarieties, Ph. D. Thesis, University of California at Berkeley, 1998.
19. Steinberg, B., On pointlike sets and joins of pseudovarieties, Internat. J. Algebra and Comput. 8 (1998) 203-231.
20. Steinberg, B., Monoid kernels and profinite topologies on the free Abelian group, Bull. Austral. Math. Soc. 60 (1999) 391-402.
21. Steinberg, B., On algorithmic problems for joins of pseudovarieties, Semigroup Forum 62 (2001) 1-40.
22. Steinberg, B., Inevitable graphs and profinite topologies: Some solutions to algorithmic problems in monoid and automata theory stemming from group theory, Internat. J. Algebra and Comput. 11 (2001) 25-71.
23. Straubing, H., Finite semigroup varieties of the form V * D, J. Pure Appl. Algebra 36 (1985) 53-94.
24. Thérien, D., and A. Weiss, Graph congruences and wreath products, J. Pure Appl. Algebra 36 (1985) 205-215.
25. Tilson, B., Categories as algebra: an essential ingredient in the theory of monoids, J. Pure Appl. Algebra 48 (1987) 83-198.
26. Tilson, B., Monoid kernels, semidirect products and their adjoint relationships, in "Semigroups and Monoids with Applications", John Rhodes (ed.), World Scientific, Singapore, 1991, 31-54.