Transformation of Program Schemes to Standard Forms
暂无分享,去创建一个
Program schemes are represented as directed, labeled graphs over some vocabulary. Such schemes are transformed to block form by obtaining a regular expression from the graph and translating it to block form by using a recursive correspondence. A necessary and sufficient condition is given for the transformed graph to be deterministic.
[1] Edward J. McCluskey,et al. Signal Flow Graph Techniques for Sequential Circuit State Diagrams , 1963, IEEE Trans. Electron. Comput..
[2] L. Eggan. Transition graphs and the star-height of regular events. , 1963 .
[3] Michael Stewart Paterson,et al. Equivalence Problems in a Model of Computation , 1967 .
[4] S. K. Basu. On Reduction of Program Schemes , 1968 .
[5] Robert McNaughton,et al. Regular Expressions and State Graphs for Automata , 1960, IRE Trans. Electron. Comput..