Skip to main content
SpringerLink
Log in

Decision algorithms for Havel's branching automata

  • Communications
  • Conference paper
  • First Online:
Mathematical Foundations of Computer Science 1975 4th Symposium, Mariánské Lázně, September 1–5, 1975 (MFCS 1975)

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

Abstract

The decision problems on (nondeterministic) branching ω-automata (ωBAs) has been proved recursively solvable. These results solve, as a special case, the decision problems on (deterministic) Havel's branching automata (DBAs), and the connected heuristic searching problems ([4]).

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. J.R. Büchi, On a decision method in restricted second order arithmetic, Proc. Internat. Congr. Logic, Method. and Philos. Sci. 1960, Stanford Univ. Press, Stanford, California, 1962, pp. 1–11.

    Google Scholar 

  2. J.R. Büchi, Decision methods in the theory of ordinals, Bull. Amer. Math. Soc. 71 (1965), 767–770.

    Google Scholar 

  3. R. McNaughton, Testing and generating infinite sequences by a finite automaton, Information and Control 9 (1966), 521–530.

    Google Scholar 

  4. I.M. Havel, Finite branching automata, Kybernetika, 10 (1974), 281–302; see SIGACT News, 23 (1974), 18.

    Google Scholar 

  5. I.M. Havel, Finite branching automata: Automata theory motivated by problem solving, Proc. Third Symp. Math. Found. Comput. Sci., 1974, Springer-Verlag, Berlin, 1975, pp. 53–61.

    Google Scholar 

  6. M. Karpiński, Almost deterministic ω-automata with existential output condition, Proc. Amer. Math. Soc, to appear shortly.

    Google Scholar 

  7. M. Karpiński, New proofs of Rabin's emptiness theorems on infinite tree automata, to appear.

    Google Scholar 

  8. N.J. Nilsson, Problem solving methods in artificial intelligence, McGraw-Hill, New York, 1971.

    Google Scholar 

  9. M.O. Rabin, Decidability of second-order theories and automata on infinite trees, Trans. Amer. Math. Soc. 141 (1969), 1–35.

    Google Scholar 

  10. M.O. Rabin, Automata on infinite objects and Church's problem, Reg. Conf. Ser. Math., Amer. Math. Soc. 13 (1972), 1–22.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. The Mathematical Institute of the Polish Academy of Sciences, 61725, Poznań, Poland

    Marek Karpiński

Authors
  1. Marek Karpiński
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Jíří Bečvář

Rights and permissions

Reprints and permissions

Copyright information

© 1975 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Karpiński, M. (1975). Decision algorithms for Havel's branching automata. 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_208

Download citation

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

  • 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

Search

Navigation