In memoriam Calvin C. Elgot

DOI10.1016/0304-3975(81)90026-8zbMath0465.01015OpenAlexW1994774069WikidataQ128036937 ScholiaQ128036937MaRDI QIDQ1154455

John C. Shepherdson

Publication date: 1981

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(81)90026-8

Mathematics Subject Classification ID

Biographies, obituaries, personalia, bibliographies (01A70)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Quantifier elimination in a problem of logical design
• Series-parallel graphs and lattices
• On new roles for categorical algebra
• The existence and construction of free iterative theories
• Matricial theories
• On the many facets of lists
• On the algebraic structure of rooted trees
• A semantically meaningful characterization of reducible flowchart schemes
• Sets recognized by n-tape automata
• The common algebraic structure of exit-automata and machines
• Decision Problems of Finite Automata Design and Related Arithmetics
• Vector Iteration in Pointed Iterative Theories
• Structured Programming With and Without go to Statements
• On Relations Defined by Generalized Finite Automata
• Decidability and undecidability of extensions of second (first) order theory of (generalized) successor
• RS -Machines with Almost Blank Tape
• Random-Access Stored-Program Machines, an Approach to Programming Languages
• ITERATION AND RECURSION
• A Perspective View of Discrete Automata and Their Design

This page was built for publication: In memoriam Calvin C. Elgot