Calvin C. Elgot - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 26 from 26

1982

A Syntax-Free Semantics for the APL OperatorsCalvin C. Elgot, Alan J. Perlis, Lawrence Snyder. ipl, 14(3):128-131, 1982.

Selected papersCalvin C. Elgot, Stephen L. Bloom. Springer, 1982.

1980

Solutions of the Iteration Equation and Extensions of the Scalar Iteration OperationStephen L. Bloom, Calvin C. Elgot, Jesse B. Wright. SICOMP, 9(1):25-45, 1980.

Vector Iteration in Pointed Iterative TheoriesStephen L. Bloom, Calvin C. Elgot, Jesse B. Wright. SICOMP, 9(3):525-540, 1980.

1979

A Semantically Meaningful Characterization of Reducible Flowchart SchemesCalvin C. Elgot, John C. Shepherdson. TCS, 8:325-357, 1979.

1978

A representative strong equivalence class for accessible flowchart schemesCalvin C. Elgot. msi 1979: 559-575

On the Algebraic Atructure of Rooted TreesCalvin C. Elgot, Stephen L. Bloom, Ralph Tindell. jcss, 16(3):362-399, 1978.

1977

On the Many Facets of ListsCalvin C. Elgot, Lawrence Snyder. TCS, 5(3):275-305, 1977.

Some Geometrical Categories Associated with Flowchart SchemesCalvin C. Elgot. fct 1977: 256-259

Finite Automaton from a Flowchart Scheme Point of ViewCalvin C. Elgot. mfcs 1977: 44-51

1976

The Existence and Construction of Free Iterative TheoriesStephen L. Bloom, Calvin C. Elgot. jcss, 12(3):305-318, 1976.

Structured Programming With and Without GO TO StatementsCalvin C. Elgot. TSE, 2(1):41-54, 1976.

Erratum and Corrigendum for Structured Programming With and Without GO TO Statments Calvin C. Elgot. TSE, 2(3):232, 1976.

1971

Algebraic theories and program schemesCalvin C. Elgot. In Erwin Engeler, editor, Symposium on Semantics of Algorithmic Languages. Volume 188 of Lecture Notes in Mathematics, pages 71-88, Springer, 1971. [doi]

1970

The common algebraic structure of exit-automata and machinesCalvin C. Elgot. computing, 6(3-4):349-370, 1970. [doi]

1966

Decidability and Undecidability of Extensions of Second (First) Order Theory of (Generalized) SuccessorCalvin C. Elgot, Michael O. Rabin. JSYML, 31(2):169-181, 1966.

1965

On Relations Defined by Generalized Finite AutomataCalvin C. Elgot, Jorge E. Mezei. ibmrd, 9(1):47-68, 1965. [doi]

1964

RS -Machines with Almost Blank TapeCalvin C. Elgot, Joseph D. Rutledge. JACM, 11(3):313-337, 1964. [doi]

Random-Access Stored-Program Machines, an Approach to Programming LanguagesCalvin C. Elgot, Abraham Robinson. JACM, 11(4):365-399, 1964. [doi]

1963

Two-sided finite-state transductions (abbreviated version)Calvin C. Elgot, Jorge E. Mezei. focs 1963: 17-22

1962

Machine properties preserved under state minimizationCalvin C. Elgot, Joseph D. Rutledge. focs 1962: 61-70

1961

Operations of finite automataCalvin C. Elgot, Joseph D. Rutledge. focs 1961: 129-132

Two problems on threshold functionsCalvin C. Elgot, Saburo Muroga. focs 1961: 166

1960

Truth functions realizable by single threshold organsCalvin C. Elgot. focs 1961: 225-245

1958

Realization of Events by Logical NetsIrving M. Copi, Calvin C. Elgot, Jesse B. Wright. JACM, 5(2):181-196, 1958. [doi]

1954

On Single vs. Triple Address Computing MachinesCalvin C. Elgot. JACM, 1(3):119-123, July 1954. [doi]

Sign in or sign up to see more results.

runs on WebDSL