On the hyperdecidability of pseudovarieties of groups

International Journal of Algebra and Computation

Volumn 11, Issue 6, 2001, Pages 753-771

  Delgado, Manuel ^a  

^a UNIVERSITY OF PORTO   (Portugal)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0035566236     PISSN: 02181967     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0218196701000802     Document Type: Article

References (19)

1. J. Almeida, Hyperdecidable pseudovarieties and the calculation of semidirect products, Int. J. Algebra Comput. 9, (3/4) (1999), 241-261.
2. J. Almeida and P. Silva, On the hyperdecidability of semidirect products of pseudovarieties, Comm. Algebra 26 (1998), 4065-4077.
3. J. Almeida and B. Steinberg, Iterated semidirect products with applications to complexity, Proc. London Math. Soc. 80 (2000), 50-74.
4. _, Syntactic and global semigroup theory, a synthesis approach, in Algorithmic Problems in Groups and Semigroups, eds. J. C. Birget, S. W. Margolis, J. Meakin and M. Sapir, Birkhäuser, 2000, pp. 1-23.
5. J. Almeida and M. Zeitoun, The pseudovariety J is hyperdecidable, Theoret. Inf. Appl. 31 (1997), 457-482.
6. C. J. Ash, Finite semigroups with commuting idempotents, J. Austral. Math. Soc., Ser. A43 (1987), 81-90.
7. _, Inevitable graphs: A proof of the type II conjecture and some related decision procedures, Int. J. Algebra Comput. 1 (1991), 127-146.
8. M. Delgado, Abelian pointlikes of a monoid, Semigroup Forum 56 (1998), 339-361.
9. E. Domenjoud and A. P. Tomás, From Elliott-MacMahon to an algorithm for general linear constraints on naturals, in Proc. 1st Int. Conf. Principles Practice Constraint Programming (CP'95), Cassis (France), Lecture Notes in Computer Science 976, (1995), 18-35.
10. K. Henckell, S. Margolis, J.-E. Pin and J. Rhodes, Ash's type II theorem, profinite topology and Malcev products, PART I, Int. J. Algebra Comput. 1 (1991), 411-436.
11. S. Margolis and J. C. Meakin, E-unitary inverse monoids and the Cayley graph of a group presentation, J. Pure Appl. Algebra 58 (1989), 45-76.
12. H. Neumann, Varieties of Groups, Springer-Verlag, 1967.
13. J.-E. Pin, Topologies for the free monoid, J. Algebra 137 (1991), 297-237.
14. _, A topological approach to a conjecture of Rhodes, Bull. Austral. Math. Soc. 38 (1988), 421-431.
15. J.-E. Pin and C. Reutenauer, A conjecture on the Hall topology for the free group, Bull. London Math. Soc. 23 (1991), 356-362.
16. J. Rhodes and B. Tilson, Improved lower bounds for the complexity of finite semigroups, J. Pure Appl. Algebra 2 (1972), 13-71.
17. L. Ribes and P. A. Zalesskiǐ, On the profinite topology on a free group, Bull. London Math. Soc. 25 (1993), 37-43.
18. _, The pro-p topology of a free group and algorithmic problems in semigroups, Int. J. Algebra Comput. 4 (1994), 359-374.
19. B. Steinberg, Inevitable graphs and profinite topologies: Some solutions to algorithmic problems in monoid and automata theory, stemming from group theory, Int. J. Algebra Comput. 11 (2001), 25-71.