Pages that link to "Item:Q5522202"

The following pages link to Flow diagrams, turing machines and languages with only two formation rules (Q5522202):

Displaying 50 items.

• Mathematical programming: Turing completeness and applications to software analysis (Q405669) (← links)
• A survey of state vectors (Q458456) (← links)
• From imperative to rule-based graph programs (Q516038) (← links)
• Normal forms in total correctness for while programs and action systems (Q549683) (← links)
• Procedure mechanisms of abstraction (Q595363) (← links)
• Closure functions and general iterates as reflectors (Q808275) (← links)
• Fundamentals of reversible flowchart languages (Q896906) (← links)
• Weighted graphs: A tool for studying the halting problem and time complexity in term rewriting systems and logic programming (Q915431) (← links)
• On the detection of unstructuredness in flowgraphs (Q1098619) (← links)
• Generation of invertible functions (Q1123625) (← links)
• Structured programs for Turing machines (Q1150270) (← links)
• An algebraic definition for control structures (Q1151016) (← links)
• The independence of control structures in abstract programming systems (Q1155949) (← links)
• Analysis of structured programs (Q1212350) (← links)
• Reduction of storage employed to represent families of information structures (Q1240554) (← links)
• PASCAL in LCF: Semantics and examples of proof (Q1242670) (← links)
• A theory of strict P-completeness (Q1337145) (← links)
• Abstract state machines: a unifying view of models of computation and of system design frameworks (Q1772776) (← links)
• Hoare's logic for nondeterministic regular programs: A nonstandard approach (Q1822934) (← links)
• On the control power of integer division (Q1838280) (← links)
• Note sulla derivata di un programma (Q1843167) (← links)
• How to make OR-results available: A proposal for project scheduling (Q1897419) (← links)
• Notes on avoiding ``go to'' statements (Q1945039) (← links)
• Condition/decision duality and the internal logic of extensive restriction categories (Q2133172) (← links)
• The tree-width of C (Q2174562) (← links)
• Distance geometry and data science (Q2192022) (← links)
• A generalized mathematical theory of structured programming (Q2265794) (← links)
• Combining dynamic and static slicing for analysing assembler (Q2266945) (← links)
• Satisfiability of the smallest binary program (Q2366070) (← links)
• Dijkstra graphs (Q2414453) (← links)
• Mapcode characterization of partial recursive maps (Q2431022) (← links)
• The complexity of register allocation (Q2442207) (← links)
• Minimality considerations for ordinal computers modeling constructibility (Q2482462) (← links)
• Plex languages (Q2547801) (← links)
• (Q3305193) (← links)
• Flowchart recognition—a syntactic approach (Q3352520) (← links)
• The Böhm–Jacopini Theorem Is False, Propositionally (Q3521987) (← links)
• Theoretical and applied aspects of structured parallel programming (Q3806794) (← links)
• (Q3863052) (← links)
• Event-driven control statements (Q4069761) (← links)
• Boolean-valued loops (Q4088262) (← links)
• (Q4125727) (← links)
• (Q4136543) (← links)
• (Q4171548) (← links)
• Consistency proof without transfinite induction for a formal system for turing machines (Q4192056) (← links)
• Asymptotic Enumeration of Predicate-Junction Flowgraphs (Q4715267) (← links)
• In Praise of Impredicativity: A Contribution to the Formalization of Meta-Programming (Q5108530) (← links)
• (Q5119396) (← links)
• Flowchart machines (Q5615718) (← links)
• On a class of fuzzy computable functions (Q5947561) (← links)