Recommendations
Cites work
- scientific article; zbMATH DE number 3125691 (Why is no real title available?)
- scientific article; zbMATH DE number 3131080 (Why is no real title available?)
- scientific article; zbMATH DE number 3167394 (Why is no real title available?)
- scientific article; zbMATH DE number 3448070 (Why is no real title available?)
- scientific article; zbMATH DE number 3229496 (Why is no real title available?)
- scientific article; zbMATH DE number 3244305 (Why is no real title available?)
- scientific article; zbMATH DE number 3261581 (Why is no real title available?)
- scientific article; zbMATH DE number 3273883 (Why is no real title available?)
- scientific article; zbMATH DE number 3291623 (Why is no real title available?)
- scientific article; zbMATH DE number 3300605 (Why is no real title available?)
- scientific article; zbMATH DE number 3302923 (Why is no real title available?)
- scientific article; zbMATH DE number 3303654 (Why is no real title available?)
- scientific article; zbMATH DE number 3307573 (Why is no real title available?)
- scientific article; zbMATH DE number 3322444 (Why is no real title available?)
- scientific article; zbMATH DE number 3336382 (Why is no real title available?)
- scientific article; zbMATH DE number 3338918 (Why is no real title available?)
- scientific article; zbMATH DE number 3342646 (Why is no real title available?)
- scientific article; zbMATH DE number 3346088 (Why is no real title available?)
- scientific article; zbMATH DE number 3351178 (Why is no real title available?)
- scientific article; zbMATH DE number 3351179 (Why is no real title available?)
- scientific article; zbMATH DE number 3351181 (Why is no real title available?)
- scientific article; zbMATH DE number 3351182 (Why is no real title available?)
- scientific article; zbMATH DE number 3351184 (Why is no real title available?)
- scientific article; zbMATH DE number 3353310 (Why is no real title available?)
- scientific article; zbMATH DE number 3362972 (Why is no real title available?)
- scientific article; zbMATH DE number 3383521 (Why is no real title available?)
- scientific article; zbMATH DE number 3390247 (Why is no real title available?)
- scientific article; zbMATH DE number 3391939 (Why is no real title available?)
- scientific article; zbMATH DE number 3403724 (Why is no real title available?)
- scientific article; zbMATH DE number 3410594 (Why is no real title available?)
- scientific article; zbMATH DE number 3410595 (Why is no real title available?)
- scientific article; zbMATH DE number 3196558 (Why is no real title available?)
- A Theory of Computer Instructions
- A constructive approach to the problem of program correctness
- A formal semantics for computer languages and its application in a compiler-compiler
- A semantic extension of BNF
- Algorithmic properties of structures
- An Informal Arithmetical Approach to Computability and Computation
- An axiomatic basis for computer programming
- Axioms and Theorems for a Theory of Arrays
- Bounded action machines: toward an abstract theory of computer structure
- Computability of Recursive Functions
- Computational complexity of random access stored program machines
- Correspondence between ALGOL 60 and Church's Lambda-notation
- Derived semantics for some programming language constructs
- EULER: A generalization of ALGOL and its formal definition: Part 1
- Eine Abstrakte Programmgesteuerte Rechenmaschine
- Equivalences on program schemes
- Fixpoint approach to the theory of computation
- Flow diagrams, turing machines and languages with only two formation rules
- Flowchart machines
- GRAPHSCHEMATA UND REKURSIVE FUNKTIONEN
- How to Program an Infinite Abacus
- Models of Computations and Systems—Evaluation of Vertex Probabilities in Graph Models of Computations
- On Ianov's Program Schemata
- On formalised computer programs
- On the nonexistence of a phrase structure grammar for ALGOL 60
- Optimization of Straight Line Programs
- Parsing algorithms with backtrack
- Program schemes, recursion schemes, and formal languages
- Programming Languages and Computers: A Unified Metatheory
- Programming by induction
- Proving Programs to be Correct
- Proving Properties of Programs by Structural Induction
- Proving algorithms by tail functions
- Proving programs correct: Some techniques and examples
- Random-Access Stored-Program Machines, an Approach to Programming Languages
- Recursive functions of symbolic expressions and their computation by machine, Part I
- Recursive unsolvability of Post's problem of Tag und other topics in theory of Turing machines
- Regular expressions and the equivalence of programs
- Semantic Translation of Programming Languages
- Semantics of context-free languages
- Semantics of context-free languages: Correction
- Some Completeness Results in the Mathematical Theory of Computation
- Some definitional suggestions for automata theory
- Some results concerning proofs of statements about programs
- Subrecursive Programming Languages, Part I
- The Formal Definition of the BASIC Language
- The Mechanical Evaluation of Expressions
- The next 700 programming languages
- The outer and inner syntax of a programming language
- The validity of return address schemes
- Time bounded random access machines
- Translator writing systems
Cited in
(3)
This page was built for publication: A survey of state vectors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q458456)
