Ivan M. Havel

According to our database, Ivan M. Havel authored at least 29 papers between 1968 and 2008.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2008

Sixty years of cybernetics: cybernetics still alive.

Ivan M. Havel

Kybernetika, 2008

1993

Artificial Thought and Emergent Mind.

Ivan M. Havel

Proceedings of the 13th International Joint Conference on Artificial Intelligence. Chambéry, France, August 28, 1993

1992

Artificial Intelligence and Connectionism: Some Philosophical Implications.

Ivan M. Havel

Proceedings of the Advanced Topics in Artificial Intelligence, 1992

1986

Artifical Intelligence: A Lesson in Human Self-Understanding.

Ivan M. Havel

Proceedings of the Impacts of Artificial Intelligence: Scientific, 1986

1982

The Truth-Reaction Paradox: A Probe of Artificial Intelligence.

Ivan M. Havel

Proceedings of the 5th European Conference on Artificial Intelligence, 1982

1980

On Branching and Looping, Part II.

Ivan M. Havel

Theor. Comput. Sci., 1980

On Branching and Looping, Part I.

Ivan M. Havel

Theor. Comput. Sci., 1980

1979

On Equivalence of Grammars Through Transformation Trees.

Michael A. Harrison, Ivan M. Havel, Amiram Yehudai

Theor. Comput. Sci., 1979

On Two Types of Loops.

Ivan M. Havel

Proceedings of the Mathematical Foundations of Computer Science 1979, 1979

1978

A stochastic approach to robot plan formation.

Ivan M. Havel, Ivan Kramosil

Kybernetika, 1978

1977

Incidental and state-dependent phenomena in robot problem solving.

Olga Stepánková, Ivan M. Havel

Kybernetika, 1977

1976

Normal forms of deterministic grammars.

Matthew M. Geller, Michael A. Harrison, Ivan M. Havel

Discret. Math., 1976

A Logical Theory of Robot Problem Solving.

Olga Stepánková, Ivan M. Havel

Artif. Intell., 1976

On the Branching Structure of Languages.

Ivan M. Havel

Proceedings of the Mathematical Foundations of Computer Science 1976, 1976

1975

Nondterministically Recognizable Sets of Languages.

Ivan M. Havel

Proceedings of the Mathematical Foundations of Computer Science 1975, 1975

1974

Automata theory motivated by problem solving.

Ivan M. Havel

SIGACT News, 1974

Finite branching automata.

Ivan M. Havel

Kybernetika, 1974

On the Parsing of Deterministic Languages.

Michael A. Harrison, Ivan M. Havel

J. ACM, 1974

Finite Branching Automata: Automata Theory Motivated by Problem Solving.

Ivan M. Havel

Proceedings of the Mathematical Foundations of Computer Science, 1974

1973

Strict Deterministic Grammars.

Michael A. Harrison, Ivan M. Havel

J. Comput. Syst. Sci., 1973

Some Results Concerning the Situation Calculus.

Olga Stepánková, Ivan M. Havel

Proceedings of the Mathematical Foundations of Computer Science: Proceedings of Symposium and Summer School, 1973

1972

Real-Time Strict Deterministic Languages.

Michael A. Harrison, Ivan M. Havel

SIAM J. Comput., 1972

The concept of indirectness in artificial intelligence.

Ivan M. Havel

Kybernetika, 1972

On a Family of Deterministic Grammars (Extended Abstract).

Michael A. Harrison, Ivan M. Havel

Proceedings of the Automata, 1972

1969

The theory of regular events. II.

Ivan M. Havel

Kybernetika, 1969

The theory of regular events. I.

Ivan M. Havel

Kybernetika, 1969

A note on one-sided context-sensitive grammars.

Ivan M. Havel

Kybernetika, 1969

1968

Regular expressions over generalized alphabet and design of logical nets.

Ivan M. Havel

Kybernetika, 1968

On the problem of the uniqueness of coding.

Ivan M. Havel

Kybernetika, 1968