Skip to main content

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

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Rabin, M.O. and Scott, D., Finite automata and their decision problems. IBM Journal of Research and Development, 3 (1959), 114–125.

    Google Scholar 

  2. Scott, D., Some definitional suggestions for automata theory. Journal of Computer and System Sciences, 1 (1967), 187–212.

    Google Scholar 

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

    Google Scholar 

  4. Havel, I.M., Finite branching automata: automata theory motivated by problem solving. In Proceedings MFCS'74 Symposium, Springer-Verlag, Berlin,1975.

    Google Scholar 

  5. Eilenberg, S., Automata, Languages, and Machines, Vol. A. Academic Press, New York, 1974.

    Google Scholar 

  6. Benda, V., Contributions to the theory of finite branching automata. (In Czech) Diploma thesis, Faculty of Mathematics and Physics, Charles University, Prague, 1975.

    Google Scholar 

  7. Karpiński, M., this volume pp. 273–279.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Jíří Bečvář

Rights and permissions

Reprints and permissions

Copyright information

© 1975 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Havel, I.M. (1975). Nondeterministically recognizable sets of languages. In: Bečvář, J. (eds) Mathematical Foundations of Computer Science 1975 4th Symposium, Mariánské Lázně, September 1–5, 1975. MFCS 1975. Lecture Notes in Computer Science, vol 32. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-07389-2_204

Download citation

  • DOI: https://doi.org/10.1007/3-540-07389-2_204

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-07389-5

  • Online ISBN: 978-3-540-37585-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics