论文信息 - INTELLIGENT GRAPHS: NETWORKS OF FINITE AUTOMATA CAPABLE OF SOLVING GRAPH PROBLEMS - 字舞流文

INTELLIGENT GRAPHS: NETWORKS OF FINITE AUTOMATA CAPABLE OF SOLVING GRAPH PROBLEMS

P. Rosenstiehl | J. Fiksel | A. Holliger

[1] Armen Gabrielian,et al. The Theory of Interacting Local Automata , 1970, Inf. Control..

[2] F. R. Moore,et al. A Generalized Firing Squad Problem , 1968, Inf. Control..

[3] Abraham Waksman,et al. An Optimum Solution to the Firing Squad Synchronization Problem , 1966, Inf. Control..

[4] H. Whitney. Non-Separable and Planar Graphs. , 1931, Proceedings of the National Academy of Sciences of the United States of America.

[5] Robert Balzer,et al. An 8-state Minimal Time Solution to the Firing Squad Synchronization Problem , 1967, Inf. Control..

[6] Jean Berstel,et al. Résolution, par un réseau d'automates, du problème des arborescences dans un graphe , 1967 .

[7] Pierre Rosenstiehl,et al. Existence d'automates finis capables de s'accorder bien qu'arbitrairement connectés et nombreux , 1966 .

[8] E. F. Moore. The firing squad synchronization problem , 1964 .

[9] J. Kruskal. On the shortest spanning subtree of a graph and the traveling salesman problem , 1956 .

[10] G. Tarry,et al. Le problème des labyrinthes , 1895 .