Flow diagrams, turing machines and languages with only two formation rules
From MaRDI portal
Publication:5522202
DOI10.1145/355592.365646zbMath0145.24204OpenAlexW2102075452WikidataQ55878185 ScholiaQ55878185MaRDI QIDQ5522202
Publication date: 1966
Published in: Communications of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/355592.365646
Related Items (51)
Satisfiability of the smallest binary program ⋮ A theory of strict P-completeness ⋮ Condition/decision duality and the internal logic of extensive restriction categories ⋮ Unnamed Item ⋮ Unnamed Item ⋮ On the detection of unstructuredness in flowgraphs ⋮ How to make OR-results available: A proposal for project scheduling ⋮ Unnamed Item ⋮ Procedure mechanisms of abstraction ⋮ Flowchart machines ⋮ Unnamed Item ⋮ The tree-width of C ⋮ Generation of invertible functions ⋮ Unnamed Item ⋮ Dijkstra graphs ⋮ Mathematical programming: Turing completeness and applications to software analysis ⋮ Distance geometry and data science ⋮ Fundamentals of reversible flowchart languages ⋮ In Praise of Impredicativity: A Contribution to the Formalization of Meta-Programming ⋮ Structured programs for Turing machines ⋮ Notes on avoiding ``go to statements ⋮ An algebraic definition for control structures ⋮ Mapcode characterization of partial recursive maps ⋮ The independence of control structures in abstract programming systems ⋮ The Böhm–Jacopini Theorem Is False, Propositionally ⋮ Weighted graphs: A tool for studying the halting problem and time complexity in term rewriting systems and logic programming ⋮ The complexity of register allocation ⋮ Unnamed Item ⋮ Event-driven control statements ⋮ A survey of state vectors ⋮ Theoretical and applied aspects of structured parallel programming ⋮ Boolean-valued loops ⋮ From imperative to rule-based graph programs ⋮ Minimality considerations for ordinal computers modeling constructibility ⋮ Analysis of structured programs ⋮ Normal forms in total correctness for while programs and action systems ⋮ A generalized mathematical theory of structured programming ⋮ Combining dynamic and static slicing for analysing assembler ⋮ Abstract state machines: a unifying view of models of computation and of system design frameworks ⋮ On a class of fuzzy computable functions ⋮ Flowchart recognition—a syntactic approach ⋮ Reduction of storage employed to represent families of information structures ⋮ PASCAL in LCF: Semantics and examples of proof ⋮ Unnamed Item ⋮ Asymptotic Enumeration of Predicate-Junction Flowgraphs ⋮ Consistency proof without transfinite induction for a formal system for turing machines ⋮ Plex languages ⋮ Hoare's logic for nondeterministic regular programs: A nonstandard approach ⋮ On the control power of integer division ⋮ Note sulla derivata di un programma ⋮ Closure functions and general iterates as reflectors
This page was built for publication: Flow diagrams, turing machines and languages with only two formation rules
