A fully equational proof of Parikh's theorem

RAIRO - Theoretical Informatics and Applications

Volumn 36, Issue 2, 2002, Pages 129-153

  Aceto, Luca ^a   Ésik, Zoltán ^b   Ingólfsdóttir, Anna ^a  

^a AALBORG UNIVERSITY   (Denmark)

^b UNIVERSITY OF SZEGED   (Hungary)

Author keywords

Algebraically complete commutative idempotent semirings; Commutative context free languages; Commutative idempotent semirings; Commutative rational languages; Complete axiomatizations; Equational logic; Parikh's theorem; Varieties

Indexed keywords

CONTEXT FREE GRAMMARS; CONTEXT FREE LANGUAGES; SET THEORY; TREES (MATHEMATICS); VECTORS;

LEAST PREFIXED POINTS; PARIKHS THEOREM;

THEOREM PROVING;

EID: 14244272301     PISSN: 09883754     EISSN: 28047346     Source Type: Journal    
DOI: 10.1051/ita:2002007     Document Type: Article

References (30)

1. H. Bekić, Definable operations in general algebras, and the theory of automata and flowcharts, Technical Report. IBM Laboratory, Vienna (1969).
2. S.L. Bloom and Z. Ésik, Floyd-Hoare logic in iteration theories. J. Assoc. Comput. Mach. 38 (1991) 887-934.
3. S.L. Bloom and Z. Ésik, Program correctness and matricial iteration theories, in Proc. Mathematical Foundations of Programming Semantics'91. Springer-Verlag, Lecture Notes in Comput. Sci. 598 (1992) 457-475.
4. S.L. Bloom and Z. Ésik, Iteration Theories. Springer-Verlag (1993).
5. S. Bozapalidis, Equational elements in additive algebras. Theory Comput. Syst. 32 (1999) 1-33.
6. C. Conway, Regular Algebra and Finite Machines. Chapman and Hall (1971).
7. J.W. De Bakker and D. Scott, A theory of programs, in IBM Seminar. Vienna (1969).
8. Z. Ésik, Group axioms for iteration. Inform. and Comput. 148 (1999) 131-180.
9. Z. Ésik and H. Leiss, Greibach normal form in algebraically complete semirings, in Proc. Annual Conference of the European Association for Computer Science Logic, CSL'02. Springer, Lecture Notes in Comput. Sci. (to appear).
10. S. Ginsburg, The Mathematical Theory of Context-Free Languages. McGraw-Hill (1966).
11. A. Ginzburg, Algebraic Theory of Automata. Academic Press, New York-London (1968).
12. J.S. Golan, Semirings and their Applications. Kluwer Academic Publishers, Dordrecht (1999).
13. J.E. Hopcroft and J.D. Ullman, Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading, Mass. (1979).
14. M.W. Hopkins and D. Kozen, Parikh's theorem in commutative Kleene algebra, in Proc. IEEE Conf. Logic in Computer Science (LICS'99). IEEE Press (1999) 394-401.
15. D.T. Huynh, The complexity of semilinear sets. Elektron. Informationsverarb. Kybernet 18 (1982) 291-338.
16. D.T. Huynh, The complexity of equivalence problems for commutative grammars. Inform. and Control 66 (1985) 103-121.
17. D. Kozen, A completeness theorem for Kleene algebras and the algebra of regular events. Inform. and Comput. 110 (1994) 366-390.
18. D. Kozen, On Hoare logic and Kleene algebra with tests, in Proc. IEEE Conf. Logic in Computer Science (LICS'99). IEEE Press (1999) 167-172.
19. D. Krob, Complete systems of B-rational identities. Theoret. Comput. Sci. 89 (1991) 207-343
20. W. Kuich, The Kleene and the Parikh theorem in complete semirings, in Proc. ICALP '87. Springer-Verlag, Lecture Notes in Comput. Sci. 267 (1987) 212-225.
21. W. Kuich, Gaussian elimination and a characterization of algebraic power series, in Proc. Mathematical Foundations of Computer Science, 1998. Springer, Berlin, Lecture Notes in Comput. Sci. 1450 (1998) 512-521.
22. W. Kuich and A. Salomaa, Semirings, Automata, Languages. Springer-Verlag, Berlin (1986).
23. E.G. Manes and M.A. Arbib, Algebraic Approaches to Program Semantics. Springer-Verlag, New York (1986).
24. D. Niwiński, On fixed-point clones (extended abstract), in Automata, Languages and Programming, Rennes, 1986. Springer, Lecture Notes in Comput. Sci. 226 (1986) 464-473.
25. R.J. Parikh, On context-free languages. J. Assoc. Comput. Mach. 13 (1966) 570-581.
26. D.M.R. Park, Fixed point induction and proofs of program properties, in Machine Intelligence, Vol. 5, Edinburgh Univ. Press (1970) 59-78.
27. D.L. Pilling, Commutative regular equations and Parikh's theorem. J. London Math. Soc. 6 (1973) 663-666.
28. V.N. Redko, On the algebra of commutative events. (Russian) Ukrain. Mat. Ž. 16 (1964) 185-195.
29. A. Salomaa, Theory of Automata. Pergamon Press (1969).
30. I. Takanami and N. Honda, A characterization of Parikh's theorem and semilinear sets by commutative semigroups with length. Electron. Comm. Japan 52 (1969) 179-184.