On two types of loops

  • Ivan M. Havel
Invited Lectures
Part of the Lecture Notes in Computer Science book series (LNCS, volume 74)


Regular Language Finite Automaton Deterministic Finite Automaton Hole Property Productive Loop 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Havel, I.M., Finite branching automata. Kybernetika, 10 (1974), 281–302.Google Scholar
  2. 2.
    Nilsson, N.J., Problem Solving Methods in Artificial Intelligence. McGraw-Hill, New York, 1971.Google Scholar
  3. 3.
    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.Google Scholar
  4. 4.
    Havel, I. M., On branching and looping. Submitted for publication.Google Scholar
  5. 5.
    Chandra, A.K. and Stockmeyer, L.J., Alternation. In: Proc. 17th Symp. Foundations of Computer Science, IEEE, 1976, pp. 98–108.Google Scholar
  6. 6.
    Kozen, D., On parallelism in Turing machines. Ibid. pp. 89–97.Google Scholar
  7. 7.
    Havel, I.M., Some remarks on searching AND-OR graphs. In: Proc. Symp. Algorithms'79, ČVTS Bratislava, 1979, pp. 45–52.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1979

Authors and Affiliations

  • Ivan M. Havel
    • 1
  1. 1.Institute of Information Theory and AutomationCzechoslovak Academy of SciencesPragueCzechoslovakia

Personalised recommendations