Preview
Unable to display preview. Download preview PDF.
References
Havel, I.M., Finite branching automata. Kybernetika, 10 (1974), 281–302.
Nilsson, N.J., Problem Solving Methods in Artificial Intelligence. McGraw-Hill, New York, 1971.
Havel, I.M., On the branching structure of languages. In: Mathematical Foundations of Computer Science 1976 (A. Mazurkiewicz, Ed.), pp. 81–98, Springer-Verlag, Berlin, 1976.
Havel, I. M., On branching and looping. Submitted for publication.
Chandra, A.K. and Stockmeyer, L.J., Alternation. In: Proc. 17th Symp. Foundations of Computer Science, IEEE, 1976, pp. 98–108.
Kozen, D., On parallelism in Turing machines. Ibid. pp. 89–97.
Havel, I.M., Some remarks on searching AND-OR graphs. In: Proc. Symp. Algorithms'79, ČVTS Bratislava, 1979, pp. 45–52.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1979 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Havel, I.M. (1979). On two types of loops. In: Bečvář, J. (eds) Mathematical Foundations of Computer Science 1979. MFCS 1979. Lecture Notes in Computer Science, vol 74. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-09526-8_7
Download citation
DOI: https://doi.org/10.1007/3-540-09526-8_7
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-09526-2
Online ISBN: 978-3-540-35088-0
eBook Packages: Springer Book Archive