A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
| Elgot, Calvin, C., A Notion of Interpretability of Algorithms in Algorithms (1966) |
| Elgot, Calvin, C., Abstract Algorithms and Diagram Closure (1966) |
| Elgot, Calvin, C., Algorithmes Abstraits et Fermeture de Diagrammes (1966) |
| Elgot, Calvin, C., Abstract Algorithms and Diagram Closure (1967) |
| Elgot, Calvin, C., Decision Problems of Finite Automata Design and Related Arithmetics (1977) |
| Elgot, Calvin, C., On New Roles for Categorical Algebra (1979) |
| Elgot, Calvin, C.; Rutledge, J.D., RS-Machines with Almost Blank Tape (1962) |
| Elgot, Calvin, C.; Shepherdson, John, C., A Semantically Meaningful Characterization of Reducible Flowchart Schemes (1977) |
| Elgot, Calvin, C; Rutledge, J.D., Operations on Finite Automata Extended Summary (1961) |
| Elgot, Calvin, C; Wright, Jesse, B., Quantifier Elimination in a Problem of Logical Design (1967) |