Semantics of flowchart programs and the free Conway theories
Bernátsky, L. ; Ésik, Z.
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 32 (1998), p. 35-78 / Harvested from Numdam
Access to full text
Full (PDF)
Full (DJVU)
Publié le : 1998-01-01
@article{ITA_1998__32_1-3_35_0,
     author = {Bern\'atsky, L. and \'Esik, Z.},
     title = {Semantics of flowchart programs and the free Conway theories},
     journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
     volume = {32},
     year = {1998},
     pages = {35-78},
     mrnumber = {1657511},
     language = {en},
     url = {http://dml.mathdoc.fr/item/ITA_1998__32_1-3_35_0}
}

Bernátsky, L.; Ésik, Z. Semantics of flowchart programs and the free Conway theories. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 32 (1998) pp. 35-78. http://gdmltest.u-ga.fr/item/ITA_1998__32_1-3_35_0/

1. S. L. Bloom, C. C. Elgot and J. B. Wright, Solutions of the iteration equation and extensions of the scalar iteration operation, SIAM Journal of Computing, 1980, 9, pp. 24-65. | MR 557823 | Zbl 0454.18011

2. S. L. Bloom, C. C. Elgot and J. B. Wright, Vector iteration in pointed iterative theories, SIAM Journal of Computing, 1980, 9, pp. 525-540. | MR 584509 | Zbl 0461.68047

3. S. L. Bloom and Z. Ésik, Axiomatizing schemes and their behaviours, Journal of Computing and System Sciences, 1985, 31, pp. 375-393. | MR 835132 | Zbl 0613.68013

4. S. L. Bloom and Z. Ésik, Floyd-Hoare logic in iteration theories, JACM, 1991, pp. 887-934. | MR 1134520 | Zbl 0799.68042

5. S. L. Bloom and Z. Ésik, Iteration Theories: The Equational Logic of Iterative Processes, EATCS Monographs on Theoretical Computer Science, Springer-Verlag, 1993. | MR 1295433 | Zbl 0773.03033

6. D. P. Bovet and P. Crescenzi, Introduction to the Theory of Complexity, Prentice-Hall, 1994. | MR 1311246 | Zbl 0809.68067

7. V. E. Cazanescu and Gh. Stefanescu, Towards a new algebraic foundation of flowchart scheme theory, Fundamenta Informaticae, 1990, 13, pp. 171-210. | MR 1074634 | Zbl 0705.68071

8. Sang Cho and Dung T. Huynh, Finite-automaton aperiodicity is PSPACE-complete, Theoretical Computer Science, 1991, 88, pp. 99-116. | MR 1130374 | Zbl 0733.68038

9. J. C. Conway, Regular Algebra and Finite Machines, Chapman and Hall, 1971. | Zbl 0231.94041

10. B. Courcelle, Fundamental properties of infinite trees. In Theoretical Foundations of Programming Methodology, Munich 1981, Reidel, 1982. | MR 696967 | Zbl 0513.68060

11. C. C. Elgot, Monadic computation and iterative algebraic theories. In J. C. Shepherdson, editor, Logic Colloquium 1973 volume 80 of Studies in Logic, Amsterdam, 1975. North Holland. | MR 413584 | Zbl 0327.02040

12. C. C. Elgot, Matricial Theories, Journal of Algebra, 1976, 42, pp. 391-421. | MR 430017 | Zbl 0361.18004

13. C. C. Elgot, Structured programmning with and without goto statements. In IEEE Transactions on Software Engineering, number 232 in SE-2, 1976, pp. 41-53. | MR 433942 | Zbl 0348.68008

14. Z. Ésik, Group axioms for iteration, to appear. | MR 1674307 | Zbl 0924.68143

15. Z. Ésik, Identities in Iterative and rational algebraic theories, Computational Linguistics and Computer Languages, 1980, 14, pp. 183-207. | MR 626263 | Zbl 0466.68010

16. J. S. Golan, The theory of semirings with applications in mathematics and theoretical computer science, Longman Scientific & Technical, 1993. | MR 1163371 | Zbl 0780.16036

17. D. Krob, Complete Systems of B-rational identities, Theoretical Computer Science, 1991, 89, pp. 207-343. | MR 1133622 | Zbl 0737.68053

18. F. W. Lawvere, Functorial Semantics of Algebraic Theories, Proceedings of the National Academy of Sciences USA, 1963, 50, pp. 869-873. | MR 158921 | Zbl 0119.25901

19. J.-E. Pin, Varieties of Formal Languages, orth Oxford Academic, 1986. | MR 912694 | Zbl 0655.68095

20. Gh. Stefanescu, On Flowchart Theories: Part I. The deterministic case, JCSS, 1987, 35, pp. 163-191. | MR 910211 | Zbl 0628.68018