Skip to main content

Finite branching automata: automata theory motivated by problem solving

  • Automata Theory
  • Conference paper
  • First Online:
Mathematical Foundations of Computer Science (MFCS 1974)

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

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. NILSSON, N.J. Problem solving methods in artificial intelligence. McGraw-Hill Book Co., New York 1971.

    Google Scholar 

  2. ŠTĚPÁNKOVÁ, O.; HAVEL, I.M. Some results concerning the situation calculus. Proc. Symp. MFCS'73, High Tatras, 1973, pp.321–326.

    Google Scholar 

  3. FIKES, R.E.; HART, P.E.; NILSSON, N.J. Some new directions in robot problem solving. In: Machine Intelligence 7 (B.Meltzer and D.Michie, ed.), Edinburgh University Press, 1972.

    Google Scholar 

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

    Google Scholar 

  5. KARPIŃSKI, M. (research in progress).

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

A. Blikle

Rights and permissions

Reprints and permissions

Copyright information

© 1975 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Havel, I.M. (1975). Finite branching automata: automata theory motivated by problem solving. In: Blikle, A. (eds) Mathematical Foundations of Computer Science. MFCS 1974. Lecture Notes in Computer Science, vol 28. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-07162-8_667

Download citation

  • DOI: https://doi.org/10.1007/3-540-07162-8_667

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-07162-4

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics