Skip to main content
SpringerLink
Log in

Pointlike Sets and Separation: A Personal Perspective

  • Conference paper
  • First Online:
Developments in Language Theory (DLT 2021)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 12811))

Included in the following conference series:

  • 426 Accesses

Abstract

This is a personal survey about pointlike sets since their inception to roughly the present. Personal means that I make no attempt to be exhaustive, but rather to highlight things that have affected my research in the area or that I consider fundamental to the area. Pointlike sets, in the language of separation and covering problems, have become very popular now in Computer Science because of the truly amazing work of Place and Zeitoun on dot-depth and related hierarchies. I believe revisiting some of the older results will revive interest and provide perspective.

The author was supported by a PSC CUNY grant.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 79.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 99.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Albert, D., Baldinger, R., Rhodes, J.: Undecidability of the identity problem for finite semigroups. J. Symb. Logic 57(1), 179–192 (1992)

    Article  MathSciNet  Google Scholar 

  2. Almeida, J., Shahzamanian, M.H., Steinberg, B.: The pro-nilpotent group topology on a free group. J. Algebra 480, 332–345 (2017)

    Article  MathSciNet  Google Scholar 

  3. Almeida, J., Zeitoun, M.: The pseudovariety \({\bf J}\) is hyperdecidable. RAIRO Inform. Théor. Appl. 31(5), 457–482 (1997)

    Article  MathSciNet  Google Scholar 

  4. Almeida, J.: Finite Semigroups and Universal Algebra. Series in Algebra, vol. 3. World Scientific Publishing Co., Inc., River Edge (1994). Translated from the 1992 Portuguese original and revised by the author

    Google Scholar 

  5. Almeida, J.: Some algorithmic problems for pseudovarieties. Publ. Math. Debrecen 54, 531–552 (1999). Automata and formal languages, VIII (Salgótarján, 1996)

    Google Scholar 

  6. Almeida, J., Azevedo, A., Zeitoun, M.: Pseudovariety joins involving \(\mathscr {J}\)-trivial semigroups. Internat. J. Algebra Comput. 9(1), 99–112 (1999)

    Article  MathSciNet  Google Scholar 

  7. Almeida, J., Costa, J.C., Zeitoun, M.: Tameness of pseudovariety joins involving R. Monatsh. Math. 146(2), 89–111 (2005)

    Article  MathSciNet  Google Scholar 

  8. Almeida, J., Costa, J.C., Zeitoun, M.: Pointlike sets with respect to \({\bf R}\) and \({\bf J}\). J. Pure Appl. Algebra 212(3), 486–499 (2008)

    Article  MathSciNet  Google Scholar 

  9. Almeida, J., Silva, P.V.: SC-hyperdecidability of \({\bf R}\). Theoret. Comput. Sci. 255(1–2), 569–591 (2001)

    Article  MathSciNet  Google Scholar 

  10. Almeida, J., Steinberg, B.: On the decidability of iterated semidirect products with applications to complexity. Proc. London Math. Soc. (3) 80(1), 50–74 (2000)

    Google Scholar 

  11. Almeida, J., Steinberg, B.: Syntactic and global semigroup theory: a synthesis approach. In: Algorithmic problems in groups and semigroups (Lincoln, NE, 1998), pp. 1–23. Trends Math., Birkhäuser Boston, Boston (2000)

    Google Scholar 

  12. Ash, C.J.: Inevitable graphs: a proof of the type \({\rm II}\) conjecture and some related decision procedures. Internat. J. Algebra Comput. 1(1), 127–146 (1991)

    Article  MathSciNet  Google Scholar 

  13. Auinger, K., Steinberg, B.: On the extension problem for partial permutations. Proc. Amer. Math. Soc. 131(9), 2693–2703 (2003)

    Google Scholar 

  14. Auinger, K., Steinberg, B.: A constructive version of the Ribes-Zalesskiĭ product theorem. Math. Z. 250(2), 287–297 (2005)

    Article  MathSciNet  Google Scholar 

  15. Benois, M.: Descendants of regular language in a class of rewriting systems: algorithm and complexity of an automata construction. In: Lescanne, P. (ed.) RTA 1987. LNCS, vol. 256, pp. 121–132. Springer, Heidelberg (1987). https://doi.org/10.1007/3-540-17220-3_11

    Chapter  Google Scholar 

  16. Costa, J.C., Nogueira, C.: Tameness of joins involving the pseudovariety of local semilattices. Internat. J. Algebra Comput. 22(7), 1250060, 35 (2012)

    Google Scholar 

  17. Delgado, M.: Abelian pointlikes of a monoid. Semigroup Forum 56(3), 339–361 (1998)

    Article  MathSciNet  Google Scholar 

  18. Eilenberg, S.: Automata, languages, and machines. Vol. B. Academic Press, New York (1976). With two chapters (“Depth decomposition theorem” and “Complexity of semigroups and morphisms”) by Bret Tilson, Pure and Applied Mathematics, vol. 59

    Google Scholar 

  19. Gool, S.J.V., Steinberg, B.: Pointlike sets for varieties determined by groups. Adv. Math. 348, 18–50 (2019)

    Google Scholar 

  20. van Gool, S.J., Steinberg, B.: Merge decompositions, two-sided Krohn-Rhodes, and aperiodic pointlikes. Canad. Math. Bull. 62(1), 199–208 (2019)

    Article  MathSciNet  Google Scholar 

  21. Henckell, K., Rhodes, J., Steinberg, B.: Aperiodic pointlikes and beyond. Int. J. Algebra Comput. 20(2), 287–305 (2010)

    Article  MathSciNet  Google Scholar 

  22. Henckell, K.: Pointlike sets: the finest aperiodic cover of a finite semigroup. J. Pure Appl. Algebra 55(1–2), 85–126 (1988)

    Article  MathSciNet  Google Scholar 

  23. Henckell, K., Lazarus, S., Rhodes, J.: Prime decomposition theorem for arbitrary semigroups: general holonomy decomposition and synthesis theorem. J. Pure Appl. Algebra 55(1–2), 127–172 (1988)

    Article  MathSciNet  Google Scholar 

  24. Henckell, K., Margolis, S.W., Pin, J.E., Rhodes, J.: Ash’s type \({\rm II}\) theorem, profinite topology and Mal\(\prime \) cev products. I. Int. J. Algebra Comput. 1(4), 411–436 (1991)

    Article  Google Scholar 

  25. Henckell, K., Rhodes, J.: The theorem of Knast, the \(PG=BG\) and type-\({\rm II}\) conjectures. In: Monoids and Semigroups with Applications (Berkeley, CA, 1989), pp. 453–463. World Scientific Publishing, River Edge (1991)

    Google Scholar 

  26. Krohn, K., Rhodes, J., Tilson, B.: Algebraic theory of machines, languages, and semigroups. Edited by Michael A. Arbib. With a major contribution by Kenneth Krohn and John L. Rhodes. Academic Press, New York (1968). Chapters 1, 5–9

    Google Scholar 

  27. Krohn, K., Rhodes, J.: Complexity of finite semigroups. Ann. Math. 2(88), 128–160 (1968)

    Article  MathSciNet  Google Scholar 

  28. Mac Lane, S.: Categories for the Working Mathematician. Graduate Texts in Mathematics, vol. 5. Springer, New York (1998)

    MATH  Google Scholar 

  29. Pin, J.E., Pinguet, A., Weil, P.: Ordered categories and ordered semigroups. Commun. Algebra 30(12), 5651–5675 (2002)

    Article  MathSciNet  Google Scholar 

  30. Place, T., Ramanathan, V., Weil, P.: Covering and separation for logical fragments with modular predicates. Log. Methods Comput. Sci. 15(2), Paper No. 11, 32 (2019)

    Google Scholar 

  31. Place, T., van Rooijen, L., Zeitoun, M.: On separation by locally testable and locally threshold testable languages. Log. Methods Comput. Sci. 10(3), 3:24, 28 (2014)

    Google Scholar 

  32. Place, T., Zeitoun, M.: Going higher in the first-order quantifier alternation hierarchy on words. In: Esparza, J., Fraigniaud, P., Husfeldt, T., Koutsoupias, E. (eds.) ICALP 2014. LNCS, vol. 8573, pp. 342–353. Springer, Heidelberg (2014). https://doi.org/10.1007/978-3-662-43951-7_29

    Chapter  MATH  Google Scholar 

  33. Place, T., Zeitoun, M.: Separating regular languages with first-order logic. Log. Methods Comput. Sci. 12(1), Paper No. 5, 31 (2016)

    Google Scholar 

  34. Place, T., Zeitoun, M.: Separation for dot-depth two. In: 2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), p. 12. IEEE, Piscataway (2017)

    Google Scholar 

  35. Place, T., Zeitoun, M.: The covering problem. Log. Methods Comput. Sci. 14(3), Paper No. 1, 54 (2018)

    Google Scholar 

  36. Place, T., Zeitoun, M.: Separation and covering for group based concatenation hierarchies. In: 2019 34th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), pp. Paper No. 17, 13. IEEE, Piscataway (2019)

    Google Scholar 

  37. Place, T., Zeitoun, M.: Adding successor: a transfer theorem for separation and covering. ACM Trans. Comput. Log. 21(2), Art. 9, 45 (2020)

    Google Scholar 

  38. Reiterman, J.: The Birkhoff theorem for finite algebras. Algebra Universalis 14(1), 1–10 (1982)

    Article  MathSciNet  Google Scholar 

  39. Rhodes, J., Steinberg, B.: Pointlike sets, hyperdecidability and the identity problem for finite semigroups. Internat. J. Algebra Comput. 9(3–4), 475–481 (1999). Dedicated to the memory of Marcel-Paul Schützenberger

    Google Scholar 

  40. Rhodes, J., Steinberg, B.: The \(q\)-theory of Finite Semigroups. Springer Monographs in Mathematics, Springer, New York (2009)

    Book  Google Scholar 

  41. Rhodes, J., Tilson, B.R.: Improved lower bounds for the complexity of finite semigroups. J. Pure Appl. Algebra 2, 13–71 (1972)

    Article  MathSciNet  Google Scholar 

  42. Ribes, L., Zalesskii, P.A.: On the profinite topology on a free group. Bull. London Math. Soc. 25(1), 37–43 (1993)

    Article  MathSciNet  Google Scholar 

  43. Ribes, L., Zalesskii, P.A.: The pro-\(p\) topology of a free group and algorithmic problems in semigroups. Int. J. Algebra Comput. 4(3), 359–374 (1994)

    Article  MathSciNet  Google Scholar 

  44. Schützenberger, M.P.: On finite monoids having only trivial subgroups. Inf. Control 8, 190–194 (1965)

    Article  MathSciNet  Google Scholar 

  45. Simon, I.: Piecewise testable events. In: Brakhage, H. (ed.) GI-Fachtagung 1975. LNCS, vol. 33, pp. 214–222. Springer, Heidelberg (1975). https://doi.org/10.1007/3-540-07407-4_23

    Chapter  Google Scholar 

  46. Steinberg, B.: Decidability and hyperdecidability of joins of pseudovarieties. ProQuest LLC, Ann Arbor, MI, thesis (Ph.D.)-University of California, Berkeley (1998)

    Google Scholar 

  47. Steinberg, B.: On pointlike sets and joins of pseudovarieties. Int. J. Algebra Comput. 8(2), 203–234 (1998). With an addendum by the author

    Google Scholar 

  48. Steinberg, B.: Monoid kernels and profinite topologies on the free abelian group. Bull. Austral. Math. Soc. 60(3), 391–402 (1999)

    Article  MathSciNet  Google Scholar 

  49. Steinberg, B.: Polynomial closure and topology. Int. J. Algebra Comput. 10(5), 603–624 (2000)

    Article  MathSciNet  Google Scholar 

  50. Steinberg, B.: A delay theorem for pointlikes. Semigroup Forum 63(3), 281–304 (2001)

    Article  MathSciNet  Google Scholar 

  51. Steinberg, B.: Finite state automata: a geometric approach. Trans. Amer. Math. Soc. 353(9), 3409–3464 (2001)

    Google Scholar 

  52. Steinberg, B.: Inevitable graphs and profinite topologies: some solutions to algorithmic problems in monoid and automata theory, stemming from group theory. Int. J. Algebra Comput. 11(1), 25–71 (2001)

    Article  MathSciNet  Google Scholar 

  53. Steinberg, B.: On algorithmic problems for joins of pseudovarieties. Semigroup Forum 62(1), 1–40 (2001)

    Article  MathSciNet  Google Scholar 

  54. Straubing, H.: Aperiodic homomorphisms and the concatenation product of recognizable sets. J. Pure Appl. Algebra 15(3), 319–327 (1979)

    Article  MathSciNet  Google Scholar 

  55. Straubing, H.: Finite semigroup varieties of the form \({\bf V}\ast {\bf D}\). J. Pure Appl. Algebra 36(1), 53–94 (1985)

    Article  MathSciNet  Google Scholar 

  56. Straubing, H.: Finite automata, formal logic, and circuit complexity. Progress in Theoretical Computer Science, Birkhäuser Boston Inc., Boston (1994)

    Google Scholar 

  57. Tilson, B.: Categories as algebra: an essential ingredient in the theory of monoids. J. Pure Appl. Algebra 48(1–2), 83–198 (1987)

    Article  MathSciNet  Google Scholar 

  58. Wedderburn, J.H.M.: Homomorphism of groups. Ann. Math. 2(42), 486–487 (1941)

    Article  MathSciNet  Google Scholar 

  59. Wilke, T.: Classifying discrete temporal properties. In: Meinel, C., Tison, S. (eds.) STACS 1999. LNCS, vol. 1563, pp. 32–46. Springer, Heidelberg (1999). https://doi.org/10.1007/3-540-49116-3_3

    Chapter  Google Scholar 

  60. Zeitoun, M.: On the decidability of the membership problem of the pseudovariety \({\bf J}\vee {\bf B}\). Int. J. Algebra Comput. 5(1), 47–64 (1995)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, City College of New York, Convent Avenue at 138th Street, New York, NY, 10031, USA

    Benjamin Steinberg

Authors
  1. Benjamin Steinberg
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Benjamin Steinberg .

Editor information

Editors and Affiliations

  1. University of Porto, Porto, Portugal

    Nelma Moreira

  2. University of Porto, Porto, Portugal

    Rogério Reis

Rights and permissions

Reprints and permissions

Copyright information

© 2021 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Steinberg, B. (2021). Pointlike Sets and Separation: A Personal Perspective. In: Moreira, N., Reis, R. (eds) Developments in Language Theory. DLT 2021. Lecture Notes in Computer Science(), vol 12811. Springer, Cham. https://doi.org/10.1007/978-3-030-81508-0_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-81508-0_3

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-81507-3

  • Online ISBN: 978-3-030-81508-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation