C. C. Elgot

发表

Structured Programming With and Without GO TO Statements

C. C. Elgot, 1976, IEEE Trans. Software Eng..

Review: Hao Wang, Symbolic Representations of Calculating Machines

C. C. Elgot, 1962 .

Review: Robert W. Ritchie, Classes of Predictably Computable Functions

C. C. Elgot, 1963 .

Wang Hao. Symbolic representations of calculating machines. Summaries of talks presented at the Summer Institute for Symbolic Logic, Cornell University, 1957, 2nd edn., Communications Research Division, Institute for Defense Analyses, Princeton, N.J., 1960, pp. 181–188.

C. C. Elgot, 1962 .

Realization of Events by Logical Nets

Calvin C. Elgot, Jesse B. Wright, C. C. Elgot, 1958, JACM.

Decision problems of finite automata design and related arithmetics

C. C. Elgot, 1961 .

An Equational Axiomatization of the Algebra of Reducible Flowchart Schemes

C. C. Elgot, J. Shepherdson, 1982 .

A semantically meaningful characterization of reducible flowchart schemes

C. C. Elgot, J. Shepherdson, 1979 .

Monadic Computation And Iterative Algebraic Theories

C. C. Elgot, 1982 .

Sets recognized by n-tape automata

C. C. Elgot, J. Shepherdson, S. Eilenberg, 1969 .

Series-parallel graphs and lattices

C. C. Elgot, J. Wright, 1959 .

On the algebraic structure of rooted trees

C. C. Elgot, R. Tindell, S. Bloom, 1978 .

Vector Iteration in Pointed Iterative Theories

C. C. Elgot, J. Wright, S. Bloom, 1980 .

Calvin C. Elgot selected papers

C. C. Elgot, S. Bloom, 1982 .

QUANTIFIER ELIMINATION IN A PROBLEM OF LOGICAL DESIGN

Calvin C. Elgot, Jesse B. Wright, C. C. Elgot, 1959 .

Review: John W. Carr., Languages, Logic, Learning, and Computers

Calvin C. Elgot, C. C. Elgot, 1959 .

Erratum and Corrigendum for "Structured Programming With and Without GO TO Statments"

Calvin C. Elgot, C. C. Elgot, 1976, IEEE Trans. Software Eng..

On Coordinated Sequential Processes

C. C. Elgot, Raymond E. Miller, 1982 .

On new roles for categorical algebra

C. C. Elgot, 1980 .

A Syntax-Free Semantics for the APL Operators

Lawrence Snyder, Alan J. Perlis, Calvin C. Elgot, 1982, Information Processing Letters.

Review: George H. Mealy, A Method for Synthesizing Sequential Circuits

Calvin C. Elgot, C. C. Elgot, 1957 .

Decision problems of finite automata design and related arithmetics

C. C. Elgot, 1962 .

Truth functions realizable by single threshold organs

Calvin C. Elgot, C. C. Elgot, 1961, SWCT.

Structured Programming With and Without go to Statements

Calvin C. Elgot, C. C. Elgot, 1976, IEEE Transactions on Software Engineering.

Operations of finite automata

Calvin C. Elgot, Joseph D. Rutledge, C. C. Elgot, 1961, SWCT.

Lectures on switching and automata theory

Calvin C. Elgot, C. C. Elgot, 1959 .

Design algorithms in automata languages : final report

Arthur W. Burks, Calvin C. Elgot, Jesse B. Wright, 1960 .

F. William Lawvere. Functorial semantics of algebraic theories. Proceedings of the National Academy of Sciences of the United States of America , vol. 50 (1963), pp. 869–872.

Calvin C. Elgot, C. C. Elgot, 1974, Journal of Symbolic Logic (JSL).

Multiple Control Computer Models

A. Robinson, Calvin C. Elgot, J. D. Rutledge, 1967 .

Mealy George H.. A method for synthesizing sequential circuits. The Bell System technical journal, vol. 34 (1955), pp. 1045–1079.

Calvin C. Elgot, C. C. Elgot, 1957, Journal of Symbolic Logic (JSL).

Selected papers

Stephen L. Bloom, Calvin C. Elgot, C. C. Elgot, 2011 .

Review: Yasuo Komamiya, Theory of Computing Relay-Networks

Calvin C. Elgot, C. C. Elgot, 1958 .

Review: Hao Wang, Circuit Synthesis by Solving Sequential Boolean Equations

Calvin C. Elgot, C. C. Elgot, 1960, Journal of Symbolic Logic (JSL).

Erratum to: Erratum and Corrigendum for “Structured Programming With and Without GO TO Statements”

Calvin C. Elgot, C. C. Elgot, 1976 .

Vector Iteration in Pointed Iterative Theories

Stephen L. Bloom, Calvin C. Elgot, Jesse B. Wright, 1980, SIAM journal on computing (Print).

Solutions of the Iteration Equation and Extensions of the Scalar Iteration Operation

Stephen L. Bloom, Calvin C. Elgot, Jesse B. Wright, 1980, SIAM J. Comput..

On the Algebraic Atructure of Rooted Trees

Stephen L. Bloom, Calvin C. Elgot, Ralph Tindell, 1978, J. Comput. Syst. Sci..

Finite Automaton from a Flowchart Scheme Point of View

Calvin C. Elgot, C. C. Elgot, 1977, International Symposium on Mathematical Foundations of Computer Science.

Some "Geometrical" Categories Associated with Flowchart Schemes

Calvin C. Elgot, C. C. Elgot, 1977, FCT.

The Existence and Construction of Free Iterative Theories

Stephen L. Bloom, Calvin C. Elgot, C. C. Elgot, 1976, J. Comput. Syst. Sci..

Carr John W., III. Languages, logic, learning, and computers. Computers and automation, vol. 7, April 1958, pp. 21–22, 25–26.

Calvin C. Elgot, C. C. Elgot, 1959, Journal of Symbolic Logic (JSL).

A representative strong equivalence class for accessible flowchart schemes

Calvin C. Elgot, C. C. Elgot, 1978, Mathematical Studies of Information Processing.

A Semantically Meaningful Characterization of Reducible Flowchart Schemes

C. C. Elgot, Calvin C. ELGOT, John C. SHEPHERDSON, 1979, Theor. Comput. Sci..

Review: Mochinori Goto, Yasuo Komamiya, Ryota Suekane, Masahide Takagi, Shigeru Kuwabara, Theory and Structure of the Automatic Relay Computer E. T. L. Mark II

Calvin C. Elgot, C. C. Elgot, 1958 .

Review: Leonard S. Bobrow, Michael A. Arbib, Discrete Mathematics: Applied Algebra for Computer and information Science

Calvin C. Elgot, C. C. Elgot, 1981, Journal of Symbolic Logic (JSL).

Lawvere F. William. An elementary theory of the category of sets. Proceedings of the National Academy of Sciences, vol. 52 (1964), pp. 1506–1511.

Calvin C. Elgot, C. C. Elgot, 1972, Journal of Symbolic Logic (JSL).

Random-Access Stored-Program Machines, an Approach to Programming Languages

Abraham Robinson, Calvin C. Elgot, C. C. Elgot, 1964, JACM.

Abstract Algorithms and Diagram Closure

Calvin C. Elgot, C. C. Elgot, 1982 .

On Relations Defined by Generalized Finite Automata

Jorge E. Mezei, Calvin C. Elgot, C. C. Elgot, 1965, IBM J. Res. Dev..