Heuristic representation of state-space by finite automaton

  • Jozef Kelemen
Part of the Lecture Notes in Computer Science book series (LNCS, volume 45)


Heuristic Method Start State Finite Automaton Crucial Property Heuristic Mapping 
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]
    Eilenberg S.: Automata, Languages and Machines, Vol. A, Academic Press, New York, 1974Google Scholar
  2. [2]
    Ernst G. W., Banerji R. B., Hookway R. J., Oyen R. A., Shaffer D. E.: Mechanical Discovery of Certain Heuristics, Case Western Reserve University, Jennings Computing Center, Report No.1136 — A, 1974Google Scholar
  3. [3]
    Hunt E. B.: Artificial Intelligence, Academic Press, New York, 1975Google Scholar
  4. [4]
    Kelemen J.: Heuristics as a Basis for Frame-Representation of State-Space (in Slovak) RNDr. Thesis, Komensky University, Bratislava, 1976Google Scholar
  5. [5]
    Minsky M.: A Framework for Representing Knowledge, in Psychology of Computer Vision (ed.: P. H. Winston), McGraw Hill, New York, 1975Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1976

Authors and Affiliations

  • Jozef Kelemen
    • 1
  1. 1.Department of Theoretical CyberneticsKomensky UniversityBratislavaCzechoslovakia

Personalised recommendations