A semantically meaningful characterization of reducible flowchart schemes (Q1254851): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Algebraic and graph theoretic characterizations of structured flowchart schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: The existence and construction of free iterative theories / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Perspective View of Discrete Automata and Their Design / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the algebraic structure of rooted trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Flow Graph Reducibility / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizations of Reducible Flow Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5639839 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3253173 / rank
 
Normal rank

Latest revision as of 01:30, 13 June 2024

scientific article
Language Label Description Also known as
English
A semantically meaningful characterization of reducible flowchart schemes
scientific article

    Statements

    A semantically meaningful characterization of reducible flowchart schemes (English)
    0 references
    0 references
    0 references
    1979
    0 references
    Reducible Flowchart Schemes
    0 references
    Semantics
    0 references

    Identifiers