scientific article; zbMATH DE number 517330

MaRDI QIDQ4282659zbMATH OpenFDO

Authors Jan L. A. van de Snepscheut

Publication date 23 February 1994

zbMATH Keywords

context-free grammarshalting problemintegrated circuitsnon-deterministic imperative programsrecursive descent parsingregular expressions

Mathematics Subject Classification ID

Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) General topics in the theory of software (68N01) Theory of compilers and interpreters (68N20) Grammars and rewriting systems (68Q42)

Cited in

(9)

• Running programs backwards: The logical inversion of imperative computation
• From Boolean algebra to unified algebra
• Invariants, composition, and substitution
• On reversible Turing machines and their function universality
• Quantum reversible fuzzy grammars
• How We Think of Computing Today
• Structured derivations: a unified proof style for teaching mathematics
• An elementary and unified approach to program correctness
• Constructing a program with exceptions

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4282659)