Skip to main content
SpringerLink
Log in

On the branching structure of languages

  • Invited Lecturers
  • 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. Book, R. V., Formal language theory and theoretical computer science. In: Automata Theory and Formal Languages, Proc. 2nd GI Conf., Lecture Notes in Computer Science 33, Springer Verlag, Berlin 1975, pp. 1–15.

    Google Scholar 

  2. Štěpánková, O. and Havel, I. M., A logical theory of robot problem solving. Artificial Intelligence 7 (1976), 165–197.

    Google Scholar 

  3. Havel, I. M., Finite branching automata: automata theory motivated by problem solving. In: Mathematical Foundations of Computer Science (A. Blikle, Ed.) Lecture Notes in Computer Science 28, Springer-Verlag, Berlin 1975, pp. 53–61.

    Google Scholar 

  4. Marcus, S., Algebraic Linguistics: Analytical Models, New York 1967.

    Google Scholar 

  5. Benda V. and Bendová, K., On specific features of recognizable families of languages. This volume

    Google Scholar 

  6. Havel, I. M., Finite branching automata. Kybernetika 10 (1974), pp. 281–302.

    Google Scholar 

  7. Bodnarčuk, V. G., Metričeskoe prostranstvo sobytij I. /The metric space of events I./ Kibernetika /Kiev/, (1965) No. 1, pp. 24–27 /In Russian/.

    Google Scholar 

  8. Dieudonné, J., Foundations of Modern Analysis, Academic Press, New York 1960.

    Google Scholar 

  9. Havel, I. M., Nondeterministic finite branching automata. Res. Report 623/75 Institute of Information Theory and Automation ČSAV, August 1975.

    Google Scholar 

  10. Havel, I. M., Nondeterministically recognizable sets of languages. In: Mathematical Foundations of Computer Science 1975 (J. Bečvář, Ed.) Lecture Notes in Computer Science 32, Springer-Verlag, Berlin 1975, pp. 252–257.

    Google Scholar 

  11. Benda, V. and Bendová, K., Recognizable filters and ideals. Commentationes Math. Univ. Carolinae 17 (1976), to appear.

    Google Scholar 

  12. Benda, V. and Bendová, K., On families recognizable by finite branching automata. /Manuscript/.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Information Theory and Automation, Czechoslovak Academy of Sciences, 180 76, Prague, Czechoslovakia

    Ivan M. Havel

Authors
  1. Ivan M. Havel
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Antoni Mazurkiewicz

Additional information

This essay is 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

Havel, I.M. (1976). On the branching structure 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_163

Download citation

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

  • 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