M. Minsky. Computation: Finite and Innite Machines. Prentice Hall, 1967. Home/Search Document Not in Database Context Related Articles Check |
This paper is cited by the following papers:
First 50 documents
Hereditary History Preserving Bisimilarity Is Undecidable - Jurdzinski, Nielsen, Srba (3 citations) (Correct)
A Comparison of Control Problems for Timed and Hybrid Systems - Cassez, Henzinger, Raskin (2002) (2 citations) (Correct)
Complexity of Two-Dimensional Patterns - Lindgren, Moore, Nordahl (2000) (7 citations) (Correct)
An Overview Of The Computational Power Of Recurrent Neural Networks - Orponen (2000) (2 citations) (Correct)
High undecidability of weak bisimilarity for Petri nets - Jancar (1994) (1 citation) (Correct)
Deciding Bisimulation-Like Equivalences with Finite-State.. - Jancar, Kucera, Mayr (1999) (10 citations) (Correct)
Undecidability of Bisimilarity for Petri Nets and Some Related.. - Jancar (1995) (22 citations) (Correct)
Stable Encoding of Finite-State Machines in.. - Carrasco.. (1999) (3 citations) (Correct)
Stable Encoding of Finite-State Machines in.. - Carrasco.. (1998) (3 citations) (Correct)
DEPTH (QUALIFIER) EXAMINATION IN THEORY OF COMPUTATION.. - Automata Languages And (Correct)
New Results on Alternating and Non-Deterministic.. - Kari, Moore (2001) (1 citation) (Correct)
Finite-State Computation in Analog Neural Networks: Steps.. - Forcada, Carrasco (2001) (1 citation) Self-citation (Minsky) (Correct)
First 50 documents
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC