Recognizing pro-𝖱 closures of regular languages

References

[1] D. Albert, R. Baldinger and J. Rhodes, Undecidability of the identity problem for finite semigroups, J. Symb. Log. 57 (1992), no. 1, 179–192. 10.2307/2275184Search in Google Scholar

[2] J. Almeida, Finite Semigroups and Universal Algebra, Ser. Algebra 3, World Scientific, River Edge, 1995. 10.1142/2481Search in Google Scholar

[3] J. Almeida, Some algorithmic problems for pseudovarieties, Publ. Math. Debrecen 54 (1999), 531–552. Search in Google Scholar

[4] J. Almeida, Profinite semigroups and applications, Structural Theory of Automata, Semigroups, and Universal Algebra, NATO Sci. Ser. II Math. Phys. Chem. 207, Springer, Dordrecht (2005), 1–45. 10.1007/1-4020-3817-8_1Search in Google Scholar

[5] J. Almeida and A. Costa, Profinite topologies, Handbook of Automata Theory. Vol. I. Theoretical Foundations, European Mathematical Society, Berlin (2021), 615–652. 10.4171/Automata-1/17Search in Google Scholar

[6] J. Almeida, J. C. Costa and M. Zeitoun, Tameness of pseudovariety joins involving R, Monatsh. Math. 146 (2005), no. 2, 89–111. 10.1007/s00605-005-0324-1Search in Google Scholar

[7] J. Almeida, J. C. Costa and M. Zeitoun, Complete reducibility of systems of equations with respect to 𝖱 , Port. Math. (N. S.) 64 (2007), no. 4, 445–508. 10.4171/PM/1792Search in Google Scholar

[8] J. Almeida, J. C. Costa and M. Zeitoun, Pointlike sets with respect to 𝐑 and 𝐉 , J. Pure Appl. Algebra 212 (2008), no. 3, 486–499. 10.1016/j.jpaa.2007.06.007Search in Google Scholar

[9] J. Almeida, J. C. Costa and M. Zeitoun, Closures of regular languages for profinite topologies, Semigroup Forum 89 (2014), no. 1, 20–40. 10.1007/s00233-014-9574-3Search in Google Scholar

[10] J. Almeida and B. Steinberg, On the decidability of iterated semidirect products with applications to complexity, Proc. Lond. Math. Soc. (3) 80 (2000), no. 1, 50–74. 10.1112/S0024611500012144Search in Google Scholar

[11] J. Almeida and P. Weil, Free profinite ℜ -trivial monoids, Internat. J. Algebra Comput. 7 (1997), no. 5, 625–671. 10.1142/S0218196797000289Search in Google Scholar

[12] J. Almeida and M. Zeitoun, An automata-theoretic approach to the word problem for ω-terms over 𝖱 , Theoret. Comput. Sci. 370 (2007), no. 1–3, 131–169. 10.1016/j.tcs.2006.10.019Search in Google Scholar

[13] C. J. Ash, Inevitable graphs: A proof of the type II conjecture and some related decision procedures, Internat. J. Algebra Comput. 1 (1991), no. 1, 127–146. 10.1142/S0218196791000079Search in Google Scholar

[14] K. Auinger and B. Steinberg, On the extension problem for partial permutations, Proc. Amer. Math. Soc. 131 (2003), no. 9, 2693–2703. 10.1090/S0002-9939-03-06860-6Search in Google Scholar

[15] T. Coulbois and A. Khelif, Equations in free groups are not finitely approximable, Proc. Amer. Math. Soc. 127 (1999), no. 4, 963–965. 10.1090/S0002-9939-99-04747-4Search in Google Scholar

[16] S. Eilenberg, Automata, Languages, and Machines. Vol. B, Pure Appl. Math. 58, Academic Press, New York, 1976. Search in Google Scholar

[17] M. Kufleitner and J. P. Wächter, The word problem for omega-terms over the Trotter-Weil hierarchy, Theory Comput. Syst. 62 (2018), no. 3, 682–738. 10.1007/978-3-319-34171-2_17Search in Google Scholar

[18] T. Place and M. Zeitoun, Separating regular languages with first-order logic, Log. Methods Comput. Sci. 12 (2016), no. 1, Paper No. 5. 10.1145/2603088.2603098Search in Google Scholar