scientific article; zbMATH DE number 517330

zbMath0817.68006MaRDI QIDQ4282659

Jan L. A. van de Snepscheut

Publication date: 23 February 1994

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

integrated circuitsregular expressionscontext-free grammarshalting problemrecursive descent parsingnon-deterministic imperative programs

Mathematics Subject Classification ID

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

Related Items

From Boolean algebra to unified algebra ⋮ On reversible Turing machines and their function universality ⋮ Invariants, composition, and substitution ⋮ Running programs backwards: The logical inversion of imperative computation ⋮ Structured derivations: a unified proof style for teaching mathematics ⋮ An elementary and unified approach to program correctness ⋮ Quantum Reversible Fuzzy Grammars ⋮ Constructing a program with exceptions