Skip to main content
SpringerLink
Log in
Book cover

International Conference on Language and Automata Theory and Applications

LATA 2013: Language and Automata Theory and Applications pp 504–515Cite as

Boolean Algebras of Regular ω-Languages

  • Conference paper

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

Abstract

We characterize up to isomorphism the Boolean algebras of regular ω-languages and of regular aperiodic ω-languages, and show decidability of classes of languages related to these characterizations.

This is a preview of subscription content, 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   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Choffrut, C., Karhumäki, J.: Combinatorics of words. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, pp. 329–438. Springer (1997)

    Google Scholar 

  2. Gehrke, M., Grigorieff, S., Pin, J.-É.: Duality and Equational Theory of Regular Languages. In: Aceto, L., Damgård, I., Goldberg, L.A., Halldórsson, M.M., Ingólfsdóttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part II. LNCS, vol. 5126, pp. 246–257. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  3. Goncharov, S.S.: Countable Boolean Algebras and Decidability. Plenum, New York (1996)

    MATH  Google Scholar 

  4. Hanf, W.: The boolean algebra of logic. Bull. Amer. Math. Soc. 20(4), 456–502 (1975)

    MathSciNet  Google Scholar 

  5. Lempp, S., Peretyat’kin, M., Solomon, R.: The lindenbaum algebra of the theory of the class of all finite models. Journal of Mathematical Logic 2(2), 145–225 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  6. Marini, C., Sorbi, A., Simi, G., Sorrentino, M.: A note on algebras of languages. Theoretical Computer Science 412, 6531–6536 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  7. Perrin, D., Pin, J.E.: Infinite Words. Applied Mathematics, vol. 141. Elsevier, Amsterdam (2004)

    MATH  Google Scholar 

  8. Pin, J.E.: On regular languages (2011) (unpublished manuscript)

    Google Scholar 

  9. Pippenger, N.: Regular languages and stone duality. Theory of Computing Systems 30(2), 121–134 (1997)

    MathSciNet  MATH  Google Scholar 

  10. Selivanov, V., Konovalov, A.: Boolean Algebras of Regular Languages. In: Mauri, G., Leporati, A. (eds.) DLT 2011. LNCS, vol. 6795, pp. 386–396. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  11. Selivanov, V.L.: Hierarchies, numerations, index sets (1992) (unpublished manuscript, 290 p.)

    Google Scholar 

  12. Selivanov, V.L.: Universal boolean algebras with applications. In: Abstracts of Int. Conf. in Algebras, p. 127. Institute of Mathematicsk, Novosibirsk (1997) (in Russian)

    Google Scholar 

  13. Selivanov, V.L.: Positive structures. In: Cooper, S., Goncharov, S. (eds.) Computability and Models, Perspectives East and West, pp. 321–350. Plenum (2003)

    Google Scholar 

  14. Sikorski, R.: Boolean Algebras. Springer, Berlin (1964)

    MATH  Google Scholar 

  15. Straubing, H.: Finite automata, formal logic and circuit complexity. Birkhäuser, Boston (1994)

    Book  MATH  Google Scholar 

  16. Szilard, A., Yu, S., Zhang, K., Shallit, J.: Characterizing Regular Languages with Polynomial Densities. In: Havel, I.M., Koubek, V. (eds.) MFCS 1992. LNCS, vol. 629, pp. 494–503. Springer, Heidelberg (1992)

    Chapter  Google Scholar 

  17. Thomas, W.: Languages, automata, and logic. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, pp. 389–455. Springer (1996)

    Google Scholar 

  18. Wagner, K.: On ω-regular sets. Information and Control 43, 123–177 (1979)

    Article  MathSciNet  MATH  Google Scholar 

  19. Yu, S.: Regular languages. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, pp. 41–110. Springer (1997)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. A.P. Ershov Institute of Informatics Systems Siberian Division Russian Academy of Sciences, Ac. Lavrentyev av. 6, 630090, Novosibirsk, Russia

    Victor Selivanov & Anton Konovalov

Authors
  1. Victor Selivanov
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Anton Konovalov
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Research Group on Mathematical Linguistics, Universitat Rovira i Virgili, Avinguda Catalunya, 35, 43002, Tarragona, Spain

    Adrian-Horia Dediu  & Carlos Martín-Vide  & 

  2. Fakultät für Informatik, Institut für Wissens- und Sprachverarbeitung, Otto-von-Guericke-Universität Magdeburg, Universitätsplatz 2, 39106, Magdeburg, Germany

    Bianca Truthe

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Selivanov, V., Konovalov, A. (2013). Boolean Algebras of Regular ω-Languages. In: Dediu, AH., Martín-Vide, C., Truthe, B. (eds) Language and Automata Theory and Applications. LATA 2013. Lecture Notes in Computer Science, vol 7810. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-37064-9_44

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-37064-9_44

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-37063-2

  • Online ISBN: 978-3-642-37064-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation