Skip to main content
SpringerLink
Log in

Recognizability for Automata

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

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

Included in the following conference series:

Abstract

We present a new approach to define boolean algebras of various language families: given a family \(\mathcal {F}\) of infinite automata, an automaton H recognizes the set of languages accepted by all automata of \(\mathcal {F}\) that can be mapped by morphism into H. Considering appropriate automata families, we get boolean algebras of context-free languages, indexed languages, Petri net languages, higher order indexed 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. Aho, A.: Indexed grammar-an extension of context-free grammars. J. ACM 15(4), 647–671 (1968)

    Article  MathSciNet  Google Scholar 

  2. Carayol, A.: Regular sets of higher-order pushdown stacks. In: Jȩdrzejowicz, J., Szepietowski, A. (eds.) MFCS 2005. LNCS, vol. 3618, pp. 168–179. Springer, Heidelberg (2005). https://doi.org/10.1007/11549345_16

    Chapter  MATH  Google Scholar 

  3. Caucal, D.: On infinite transition graphs having a decidable monadic theory. Theor. Comput. Sci. 290, 79–115 (2003)

    Article  MathSciNet  Google Scholar 

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

    Google Scholar 

  5. Eilenberg, S.: Algèbre catégorique et théorie des automates, Institut H. Poincaré. Université de Paris (1967)

    Google Scholar 

  6. Eilenberg, S.: Automata, Languages and Machines, vol. A. Academic Press, New-York (1974)

    MATH  Google Scholar 

  7. Elgot, C., Mezei, J.: On relations defined by generalized finite automata. IBM J. Res. Dev. 9(1), 47–68 (1965)

    Article  MathSciNet  Google Scholar 

  8. Fratani, S.: Automates à piles de piles \(\ldots \) de piles, Ph.D thesis. University Bordeaux 1 (2005)

    Google Scholar 

  9. Immerman, N.: Nondeterministic space is closed under complementation. SIAM J. Comput. 17(5), 935–938 (1988)

    Article  MathSciNet  Google Scholar 

  10. Kuroda, S.: Classes of languages and linear-bounded automata. Inf. Control 7(2), 207–223 (1964)

    Article  MathSciNet  Google Scholar 

  11. Maslov, A.: The hierarchy of indexed languages of an arbitrary level. Doklady Akademii Nauk SSSR 217, pp. 1013–1016 (1974)

    Google Scholar 

  12. 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 

  13. 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 

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

    Article  Google Scholar 

  15. Semenov, A.L.: Decidability of monadic theories. In: Chytil, M.P., Koubek, V. (eds.) MFCS 1984. LNCS, vol. 176, pp. 162–175. Springer, Heidelberg (1984). https://doi.org/10.1007/BFb0030296

    Chapter  Google Scholar 

  16. Szelepcsnyi, R.: The method of forced enumeration for nondeterministic automata. Acta Inform. 26(3), 279–284 (1988)

    Article  MathSciNet  Google Scholar 

  17. Thomas, W.: Uniform and nonuniform recognizability. Theor. Comput. Sci. 292, 299–316 (2003)

    Article  MathSciNet  Google Scholar 

Download references

Acknowledgments

Thanks to Arnaud Carayol for his remarks and for the example of Proposition 3.1.

Author information

Authors and Affiliations

  1. LIGM–CNRS, University Paris-Est, Marne-la-Vallée, 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 Chloé Rispal .

Editor information

Editors and Affiliations

  1. National Archives of Japan, Tokyo, Japan

    Mizuho Hoshi

  2. The University of Electro-Communications, Tokyo, Japan

    Shinnosuke Seki

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Caucal, D., Rispal, C. (2018). Recognizability for Automata. In: Hoshi, M., Seki, S. (eds) Developments in Language Theory. DLT 2018. Lecture Notes in Computer Science(), vol 11088. Springer, Cham. https://doi.org/10.1007/978-3-319-98654-8_17

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-98654-8_17

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-98653-1

  • Online ISBN: 978-3-319-98654-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation