Calvin C. Elgot

According to our database, Calvin C. Elgot authored at least 26 papers between 1954 and 1982.

Collaborative distances:

• Dijkstra number of two.
• Erdős number of three.

1982

A Syntax-Free Semantics for the APL Operators.

Calvin C. Elgot, Alan J. Perlis, Lawrence Snyder

Inf. Process. Lett., 1982

Selected papers.

Calvin C. Elgot, Stephen L. Bloom

Springer, ISBN: 978-3-540-90698-8, 1982

1980

Vector Iteration in Pointed Iterative Theories.

Stephen L. Bloom, Calvin C. Elgot, Jesse B. Wright

SIAM J. Comput., 1980

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

Stephen L. Bloom, Calvin C. Elgot, Jesse B. Wright

SIAM J. Comput., 1980

1979

A Semantically Meaningful Characterization of Reducible Flowchart Schemes.

Calvin C. Elgot, John C. Shepherdson

Theor. Comput. Sci., 1979

1978

On the Algebraic Atructure of Rooted Trees.

Calvin C. Elgot, Stephen L. Bloom, Ralph Tindell

J. Comput. Syst. Sci., 1978

A representative strong equivalence class for accessible flowchart schemes.

Calvin C. Elgot

Proceedings of the Mathematical Studies of Information Processing, 1978

1977

On the Many Facets of Lists.

Calvin C. Elgot, Lawrence Snyder

Theor. Comput. Sci., 1977

Finite Automaton from a Flowchart Scheme Point of View.

Calvin C. Elgot

Proceedings of the Mathematical Foundations of Computer Science 1977, 1977

Some "Geometrical" Categories Associated with Flowchart Schemes.

Calvin C. Elgot

Proceedings of the Fundamentals of Computation Theory, 1977

1976

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

Calvin C. Elgot

IEEE Trans. Software Eng., 1976

Structured Programming With and Without GO TO Statements.

Calvin C. Elgot

IEEE Trans. Software Eng., 1976

The Existence and Construction of Free Iterative Theories.

Stephen L. Bloom, Calvin C. Elgot

J. Comput. Syst. Sci., 1976

1971

Algebraic theories and program schemes.

Calvin C. Elgot

Proceedings of the Symposium on Semantics of Algorithmic Languages, 1971

1970

The common algebraic structure of exit-automata and machines.

Calvin C. Elgot

Computing, 1970

1966

Decidability and Undecidability of Extensions of Second (First) Order Theory of (Generalized) Successor.

Calvin C. Elgot, Michael O. Rabin

J. Symb. Log., 1966

1965

On Relations Defined by Generalized Finite Automata.

Calvin C. Elgot, Jorge E. Mezei

IBM J. Res. Dev., 1965

1964

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

Calvin C. Elgot, Abraham Robinson

J. ACM, 1964

RS -Machines with Almost Blank Tape.

Calvin C. Elgot, Joseph D. Rutledge

J. ACM, 1964

1963

Two-sided finite-state transductions (abbreviated version)

Calvin C. Elgot, Jorge E. Mezei

Proceedings of the 4th Annual Symposium on Switching Circuit Theory and Logical Design, 1963

1962

Machine properties preserved under state minimization

Calvin C. Elgot, Joseph D. Rutledge

Proceedings of the 3rd Annual Symposium on Switching Circuit Theory and Logical Design, 1962

1961

Operations of finite automata

Calvin C. Elgot, Joseph D. Rutledge

Proceedings of the 2nd Annual Symposium on Switching Circuit Theory and Logical Design, 1961

Two problems on threshold functions

Calvin C. Elgot, Saburo Muroga

Proceedings of the 2nd Annual Symposium on Switching Circuit Theory and Logical Design, 1961

1960

Truth functions realizable by single threshold organs

Calvin C. Elgot

Proceedings of the 1st Annual Symposium on Switching Circuit Theory and Logical Design, 1960

1958

Realization of Events by Logical Nets.

Irving M. Copi, Calvin C. Elgot, Jesse B. Wright

J. ACM, 1958

1954

On Single vs. Triple Address Computing Machines

Calvin C. Elgot

J. ACM, July, 1954