Calvin C. Elgot

26 papers B 2Journal 16Unranked 6
YearRankTypeTitle / Venue / Authors
1982 J jnl
A Syntax-Free Semantics for the APL Operators.
Inf. Process. Lett.
Calvin C. Elgot, Alan J. Perlis, Lawrence Snyder
1982 — book
Selected papers.
Calvin C. Elgot, Stephen L. Bloom
1980 J jnl
Solutions of the Iteration Equation and Extensions of the Scalar Iteration Operation.
SIAM J. Comput.
Stephen L. Bloom, Calvin C. Elgot, Jesse B. Wright
1980 J jnl
Vector Iteration in Pointed Iterative Theories.
SIAM J. Comput.
Stephen L. Bloom, Calvin C. Elgot, Jesse B. Wright
1979 J jnl
A Semantically Meaningful Characterization of Reducible Flowchart Schemes.
Theor. Comput. Sci.
Calvin C. Elgot, John C. Shepherdson
1978 — conf
A representative strong equivalence class for accessible flowchart schemes.
Mathematical Studies of Information Processing
Calvin C. Elgot
1978 J jnl
On the Algebraic Atructure of Rooted Trees.
J. Comput. Syst. Sci.
Calvin C. Elgot, Stephen L. Bloom, Ralph Tindell
1977 B conf
Finite Automaton from a Flowchart Scheme Point of View.
MFCS
Calvin C. Elgot
1977 J jnl
On the Many Facets of Lists.
Theor. Comput. Sci.
Calvin C. Elgot, Lawrence Snyder
1977 B conf
Some "Geometrical" Categories Associated with Flowchart Schemes.
FCT
Calvin C. Elgot
1976 J jnl
Erratum and Corrigendum for "Structured Programming With and Without GO TO Statments".
IEEE Trans. Software Eng.
Calvin C. Elgot
1976 J jnl
Structured Programming With and Without GO TO Statements.
IEEE Trans. Software Eng.
Calvin C. Elgot
1976 J jnl
The Existence and Construction of Free Iterative Theories.
J. Comput. Syst. Sci.
Stephen L. Bloom, Calvin C. Elgot
1971 — ch.
Algebraic theories and program schemes.
Symposium on Semantics of Algorithmic Languages
Calvin C. Elgot
1970 J jnl
The common algebraic structure of exit-automata and machines.
Computing
Calvin C. Elgot
1966 J jnl
Decidability and Undecidability of Extensions of Second (First) Order Theory of (Generalized) Successor.
J. Symb. Log.
Calvin C. Elgot, Michael O. Rabin
1965 J jnl
On Relations Defined by Generalized Finite Automata.
IBM J. Res. Dev.
Calvin C. Elgot, Jorge E. Mezei
1964 J jnl
RS -Machines with Almost Blank Tape.
J. ACM
Calvin C. Elgot, Joseph D. Rutledge
1964 J jnl
Random-Access Stored-Program Machines, an Approach to Programming Languages.
J. ACM
Calvin C. Elgot, Abraham Robinson
1963 — conf
Two-sided finite-state transductions (abbreviated version)
SWCT
Calvin C. Elgot, Jorge E. Mezei
1962 — conf
Machine properties preserved under state minimization
SWCT
Calvin C. Elgot, Joseph D. Rutledge
1961 — conf
Operations of finite automata
SWCT
Calvin C. Elgot, Joseph D. Rutledge
1961 — conf
Two problems on threshold functions
SWCT
Calvin C. Elgot, Saburo Muroga
1960 — conf
Truth functions realizable by single threshold organs
SWCT
Calvin C. Elgot
1958 J jnl
Realization of Events by Logical Nets.
J. ACM
Irving M. Copi, Calvin C. Elgot, Jesse B. Wright
1954 J jnl
On Single vs. Triple Address Computing Machines
J. ACM
Calvin C. Elgot