Skip to main content
SpringerLink
Log in

On specific features of recognizable families of languages

  • Communications
  • Conference paper
  • First Online:
Mathematical Foundations of Computer Science 1976 (MFCS 1976)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 45))

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Havel, I. M., Finite Branching Automata. Kybernetika 10 1974, 281–302.

    Google Scholar 

  2. Benda, V. and Bendová, K., On Families Recognizable by Finite Branching Automata /in preparation/.

    Google Scholar 

  3. Havel, I. M., On the Branching Structure of Languages. This volume, pp.

    Google Scholar 

  4. Eilenberg, S., Automata, Languages, and Machines. Volume A. Academic Press, New York 1974.

    Google Scholar 

  5. Cohn, P. M., Universal Algebra. Harper and Row, New York 1965.

    Google Scholar 

  6. Benda V. and Bendová K., Recognizable Filters and Ideals. Commentationes Math. Univ. Carolinae /to appear/.

    Google Scholar 

  7. Katětov, M., O základech matematického vyjadřování plánu /On the basis of mathematical expression of a plan/. Mimeographed notes, Faculty of Mathematics and Physics, Charles University.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Railway Research Institute, 118 00, Prague 1

    Václav Benda

  2. Mathematical Institute ČSAV, 115 67, Prague 1, Czechoslovakia

    Kamila Bendová

Authors
  1. Václav Benda
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Kamila Bendová
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Antoni Mazurkiewicz

Additional information

Dedicated to Professor Jiří Bečvář on the occasion of his fiftieth birthday.

Rights and permissions

Reprints and permissions

Copyright information

© 1976 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Benda, V., Bendová, K. (1976). On specific features of recognizable families of languages. In: Mazurkiewicz, A. (eds) Mathematical Foundations of Computer Science 1976. MFCS 1976. Lecture Notes in Computer Science, vol 45. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-07854-1_173

Download citation

  • DOI: https://doi.org/10.1007/3-540-07854-1_173

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-07854-8

  • Online ISBN: 978-3-540-38169-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation