EDP Sciences logo
Subscriber Authentication Point
Search
Menu
All issues Volume 32 / No 1-3 (1998) RAIRO-Theor. Inf. Appl., 32 1-3 (1998) 35-78 References
Free Access
Issue
RAIRO-Theor. Inf. Appl.
Volume 32, Number 1-3, 1998
Page(s) 35 - 78
DOI https://doi.org/10.1051/ita/1998321-300351
Published online 01 February 2017
  1. 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] [Google Scholar]
  2. 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] [Google Scholar]
  3. 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] [Google Scholar]
  4. 4. S. L. BLOOM and Z. ÉSIK, Floyd-Hoare logic in iteration theories, JACM, 1991, pp. 887-934. [MR: 1134520] [Zbl: 0799.68042] [Google Scholar]
  5. 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] [Google Scholar]
  6. 6. D. P. BOVET and P. CRESCENZI, Introduction to the Theory of Complexity, Prentice-Hall, 1994. [MR: 1311246] [Zbl: 0809.68067] [Google Scholar]
  7. 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] [Google Scholar]
  8. 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] [Google Scholar]
  9. 9. J. C. CONWAY, Regular Algebra and Finite Machines, Chapman and Hall, 1971. [Zbl: 0231.94041] [Google Scholar]
  10. 10. B. COURCELLE, Fundamental properties of infinite trees. In Theoretical Foundations of Programming Methodology, Munich 1981, Reidel, 1982. [MR: 696967] [Zbl: 0513.68060] [Google Scholar]
  11. 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] [Google Scholar]
  12. 12. C. C. ELGOT, Matricial Theories, Journal of Algebra, 1976, 42, pp. 391-421. [MR: 430017] [Zbl: 0361.18004] [Google Scholar]
  13. 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] [Google Scholar]
  14. 14. Z. ÉSIK, Group axioms for iteration, to appear. [MR: 1674307] [Zbl: 0924.68143] [Google Scholar]
  15. 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] [Google Scholar]
  16. 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] [Google Scholar]
  17. 17. D. KROB, Complete Systems of B-rational identities, Theoretical Computer Science, 1991, 89, pp. 207-343. [MR: 1133622] [Zbl: 0737.68053] [Google Scholar]
  18. 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] [Google Scholar]
  19. 19. J.-E. PIN, Varieties of Formal Languages, orth Oxford Academic, 1986. [MR: 912694] [Zbl: 0655.68095] [Google Scholar]
  20. 20. Gh. STEFANESCU, On Flowchart Theories: Part I. The deterministic case, JCSS, 1987, 35, pp. 163-191. [MR: 910211] [Zbl: 0628.68018] [Google Scholar]

Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.

Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.

Initial download of the metrics may take a while.