Skip to main content
SpringerLink
Log in

Boolean Algebras by Length Recognizability

  • Chapter
  • First Online:
Models, Mindsets, Meta: The What, the How, and the Why Not?

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

  • 435 Accesses

Abstract

We present a simple approach to define Boolean algebras on languages. We proceed by inverse deterministic and length-preserving morphisms on automata whose vertices are words. We give applications for context-free languages and context-sensitive languages.

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 39.99
Price excludes VAT (USA)
  • Available as EPUB and 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

Institutional subscriptions

References

  1. Alur, R., Madhusudan, P.: Visibly pushdown languages. In: Babai, L. (ed.) 36th STOC ACM Proceedings, pp. 202–211 (2004)

    Google Scholar 

  2. Burkart, O., Caucal, D., Moller, F., Steffen, B.: Verification on infinite structures. In: Handbook of Process Algebra, pp. 545–623 (2001)

    Chapter  Google Scholar 

  3. Caucal, D.: On infinite transition graphs having a decidable monadic theory. In: Meyer, F., Monien, B. (eds.) ICALP 1996. LNCS, vol. 1099, pp. 194–205. Springer, Heidelberg (1996). https://doi.org/10.1007/3-540-61440-0_128

    Chapter  Google Scholar 

  4. Caucal, D.: Boolean algebras of unambiguous context-free languages. In: Hariharan, R., Mukund, M., Vinay, V. (eds.) 28th FSTTCS, Dagstuhl Research Server (2008)

    Google Scholar 

  5. Caucal, D., Rispal, C.: Recognizability for automata. In: Hoshi, M., Seki, S. (eds.) DLT 2018. LNCS, vol. 11088, pp. 206–218. Springer, Cham (2018). https://doi.org/10.1007/978-3-319-98654-8_17

    Chapter  Google Scholar 

  6. Eilenberg, S.: Algèbre catégorique et théorie des automates, Institut H. Poincaré (1967). and Automata, languages and machines, Vol. A, Academic Press (1974)

    Google Scholar 

  7. Mehlhorn, K.: Pebbling mountain ranges and its application to DCFL-recognition. In: de Bakker, J., van Leeuwen, J. (eds.) ICALP 1980. LNCS, vol. 85, pp. 422–435. Springer, Heidelberg (1980). https://doi.org/10.1007/3-540-10003-2_89

    Chapter  Google Scholar 

  8. Nowotka, D., Srba, J.: Height-Deterministic Pushdown Automata. In: Kučera, L., Kučera, A. (eds.) MFCS 2007. LNCS, vol. 4708, pp. 125–134. Springer, Heidelberg (2007). https://doi.org/10.1007/978-3-540-74456-6_13

    Chapter  Google Scholar 

  9. Rispal, C.: The synchronized graphs trace the context-sensitive languages. Electr. Notes Theor. Comput. Sci. 68(6), 55–70 (2002)

    Article  Google Scholar 

  10. Thomas, W.: Uniform and nonuniform recognizability. Theoretical Computer Science 292, 299–316 (2003)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. CNRS, LIGM, University Paris-Est, Paris, France

    Didier Caucal & Chloé Rispal

Authors
  1. Didier Caucal
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Chloé Rispal
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Didier Caucal .

Editor information

Editors and Affiliations

  1. Lero–The Irish Software Research Center, University of Limerick, Limerick, Ireland

    Tiziana Margaria

  2. Verimag Laboratory, Grenoble, France

    Susanne Graf

  3. Aalborg University, Aalborg, Denmark

    Kim G. Larsen

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Caucal, D., Rispal, C. (2019). Boolean Algebras by Length Recognizability. In: Margaria, T., Graf, S., Larsen, K. (eds) Models, Mindsets, Meta: The What, the How, and the Why Not?. Lecture Notes in Computer Science(), vol 11200. Springer, Cham. https://doi.org/10.1007/978-3-030-22348-9_11

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-22348-9_11

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-22347-2

  • Online ISBN: 978-3-030-22348-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation