ISSN:
1572-9125
Keywords:
Program flowcharts
;
finite state machines
;
graphs
;
push-down machines
;
canonical programs
;
computer organization
;
regular-
;
deterministic-and definite computations
;
4.20
;
5.22–24
;
5.32
;
6.20
;
6.33
Source:
Springer Online Journal Archives 1860-2000
Topics:
Mathematics
Notes:
Abstract Let ℱ denote a conventional flowchart. Any algorithm can be represented by a flowchart. If action nodes in ℱ call ℱ then ℱ is a recursive flowchart. We show how to decompose arbitrary non-self-modifying programs into structure and atomic parts. We specifically give the synthesis procedure for a controller ℳ. ℳ can serve as the only sequencer in an execution of ℱ. If ℱ is recursive then ℳ is a pushdown machine, otherwise ℳ is a finite state machine. The next-state functionf and the output functiong of ℳ represent respectively all of the structure-, i.e. the programmer-oriented-, and all of the atomic-, i.e. the data-oriented-, parts of ℱ.f defines the flow or pattern of computations andg the actual transformations or operations on data. Thus we construct and analyze programs by constructing and analyzing their sequencers ℳ.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1007/BF01935563
Permalink
