A survey of state vectors

DOI10.1016/J.COSREV.2008.02.003zbMATH Open1302.68116OpenAlexW1494212109MaRDI QIDQ458456FDOQ458456

Authors: Ward Douglas Maurer 

Publication date: 7 October 2014

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

Full work available at URL: https://doi.org/10.1016/j.cosrev.2008.02.003

Recommendations

• The Theory of Automata, a Survey
• Computer science and state machines
• Real-time vector automata
• Building a model of a useful Turing machine
• scientific article; zbMATH DE number 2150282

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to computer science (68-02) History of computer science (68-03)

Cites Work

• EULER: A generalization of ALGOL and its formal definition: Part 1
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• An axiomatic basis for computer programming
• Recursive unsolvability of Post's problem of Tag und other topics in theory of Turing machines
• Title not available (Why is that?)
• Title not available (Why is that?)
• Recursive functions of symbolic expressions and their computation by machine, Part I
• Title not available (Why is that?)
• Title not available (Why is that?)
• Semantics of context-free languages
• Semantics of context-free languages: Correction
• Program schemes, recursion schemes, and formal languages
• How to Program an Infinite Abacus
• Correspondence between ALGOL 60 and Church's Lambda-notation
• The Mechanical Evaluation of Expressions
• Flow diagrams, turing machines and languages with only two formation rules
• Computability of Recursive Functions
• Time bounded random access machines
• A constructive approach to the problem of program correctness
• Title not available (Why is that?)
• The validity of return address schemes
• Bounded action machines: toward an abstract theory of computer structure
• Some definitional suggestions for automata theory
• Regular expressions and the equivalence of programs
• Some results concerning proofs of statements about programs
• On formalised computer programs
• Equivalences on program schemes
• Programming by induction
• Eine Abstrakte Programmgesteuerte Rechenmaschine
• Title not available (Why is that?)
• Parsing algorithms with backtrack
• Axioms and Theorems for a Theory of Arrays
• Title not available (Why is that?)
• A formal semantics for computer languages and its application in a compiler-compiler
• The next 700 programming languages
• Title not available (Why is that?)
• GRAPHSCHEMATA UND REKURSIVE FUNKTIONEN
• Some Completeness Results in the Mathematical Theory of Computation
• Translator writing systems
• Proving Properties of Programs by Structural Induction
• Models of Computations and Systems—Evaluation of Vertex Probabilities in Graph Models of Computations
• Programming Languages and Computers: A Unified Metatheory
• Title not available (Why is that?)
• The outer and inner syntax of a programming language
• A Theory of Computer Instructions
• Title not available (Why is that?)
• Title not available (Why is that?)
• Random-Access Stored-Program Machines, an Approach to Programming Languages
• Title not available (Why is that?)
• Algorithmic properties of structures
• Title not available (Why is that?)
• Proving programs correct: Some techniques and examples
• Title not available (Why is that?)
• Flowchart machines
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Semantic Translation of Programming Languages
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Computational complexity of random access stored program machines
• Title not available (Why is that?)
• The Formal Definition of the BASIC Language
• Title not available (Why is that?)
• Proving Programs to be Correct
• Proving algorithms by tail functions
• Title not available (Why is that?)
• Fixpoint approach to the theory of computation
• Derived semantics for some programming language constructs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Optimization of Straight Line Programs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Subrecursive Programming Languages, Part I
• A semantic extension of BNF
• An Informal Arithmetical Approach to Computability and Computation
• On the nonexistence of a phrase structure grammar for ALGOL 60
• On Ianov's Program Schemata
• Title not available (Why is that?)

Cited In (3)

• Computer science and state machines
• Title not available (Why is that?)
• Title not available (Why is that?)

Uses Software

• ALGOL 60
• Euler

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)