Regular expressions for program computations

American Mathematical Monthly

Volumn 104, Issue 2, 1997, Pages 120-129

  Prather, Ronald E ^a  

^a NONE

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0039978254     PISSN: 00029890     EISSN: None     Source Type: Journal    
DOI: 10.2307/2974979     Document Type: Article

References (11)

1. C. Böhm and G. Jacopini, Flow diagrams, Turing machines and languages with only two formation rules, Communications of the ACM 9 (1966), 366-371.
2. O. Dahl, E. Dijkstra and C. Hoare, Structured Programming, Academic Press, New York, 1972.
3. E. Dijkstra, Goto statement considered harmful, Communications of the ACM 11 (1968), 147-148.
4. N. Fenton, Software Metrics: A Rigorous Approach, Chapman and Hall, New York, 1991.
5. N. Fenton and R. Whitty, Axiomatic approach to software metrication, The Computer Journal 29 (1986), 330-339.
6. F. Harary, Graph Theory, Addison-Wesley, Reading, MA, 1972.
7. A. Ginzberg, Algebraic Theory of Automata, Academic Press, New York, 1968.
8. B. Marion, Turing machines and computational complexity, Amer. Math. Monthly 101 (1994), 61-65.
9. C. McGeoch, Data compression, Amer. Math. Monthly 100 (1993), 493-497.
10. R. Prather and S. Guilieri, Decomposition of flowchart schemata, The Computer Journal 24 (1981), 258-262.
11. R. Prather, Design and analysis of hierarchical software metrics, ACM Computing Surveys 27 (1995), 499-518.