Algebraically complete semirings and Greibach normal form

Annals of Pure and Applied Logic

Volumn 133, Issue 1-3 SPEC. ISS., 2005, Pages 173-203

  Ésik, Zoltán ^a   Leiß, Hans ^b  

^a UNIVERSITY OF SZEGED   (Hungary)

^b UNIVERSITY OF MUNICH   (Germany)

Author keywords

Algebraically complete semiring; Context free languages; Conway semiring; Equational theory; Greibach normal form; Kleene algebra; Pre fixed point induction

Indexed keywords

EID: 14644396243     PISSN: 01680072     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.apal.2004.10.008     Document Type: Article

References (28)

1. L. Aceto Z. Ésik A. Ingólfsdóttir A fully equational proof of Parikh's theorem Theor. Inform. Appl. 36 2002 129-154
2. J.C.M. Baeten J.A. Bergstra J.W. Klop Decidability of bisimulation equivalence for processes generating context-free languages J. ACM 40 3 1993 653-682
3. H. Bekić Definable operations in general algebra, and the theory of automata and flowcharts. Technical Report, IBM Laboratory, Vienna, 1969
4. L. Bernátsky S.L. Bloom Z. Ésik Gh. Stefanescu Equational theories of relations and regular sets, extended abstract in: Proc. of the Conf. on Words, Combinatorics and Semigroups Kyoto, 1992 1994 World Scientific Publishing Co. Pte. Ltd. pp. 40-48
5. L. Bernátsky Z. Ésik Semantics of flowchart programs and the free Conway theories Theor. Inform. Appl. 32 1998 35-78
6. S.L. Bloom Z. Ésik Iteration Theories 1993 Springer
7. M. Boffa Une remarque sur les systèmes complets d'identités rationnelles RAIRO Inform. Théor. Appl. 24 1990 419-423
8. M. Boffa Une condition impliquant toutes les identités rationnelles RAIRO Inform. Théor. Appl. 29 1995 515-518
9. J.H. Conway Regular Algebra and Finite Machines 1971 Chapman and Hall London
10. J.W. de Bakker, D. Scott, A theory of programs, IBM Seminar, August, 1969
11. Z. Ésik Completeness of park induction Theoret. Comput. Sci. 177 1997 217-283
12. Z. Ésik W. Kuich Inductive *-semirings Theoret. Comput. Sci. 324 2004 3-33
13. S.A. Greibach A new normal-form theorem for context-free, phrase-structure grammars J. Assoc. Comput. Mach. 12 1965 42-52
14. M. Harrison Introduction to Formal Languages 1978 Addison Wesley Reading, MA
15. J. Hopcroft J.D. Ullman Formal Languages and their Relation to Automata 1979 Addison Wesley Reading, MA
16. M.W. Hopkins D. Kozen Parikh's theorem in commutative Kleene algebra in: Proc. IEEE Conf. Logic in Computer Science, LICS'99 1999 IEEE Press pp. 394-401
17. D. Kozen A completeness theorem for Kleene algebras and the algebra of regular events in: 6th Ann. Symp. on Logic in Computer Science, LICS'91 1991 Computer Society Press pp. 214-225
18. D. Kozen On the complexity of reasoning in Kleene algebra in: Proc. 12th Symp. Logic in Computer Science 1997 IEEE Press pp. 195-202
19. D. Krob Complete systems of B-rational identities Theoret. Comput. Sci. 89 1991 207-343
20. W. Kuich Semirings and formal power series in: G. Rozenberg A. Salomaa (Eds.) Handbook of Formal Languages vol. 1 1997 Springer pp. 609-678
21. H. Leiß Towards Kleene algebra with recursion in: Proc. 5th Workshop on Computer Science Logic, CSL'91 LNCS 626 1991 Springer pp. 242-256
22. K.C. Ng A. Tarski Relation algebras with transitive closure Notices of the American Math. Society 24 1977 A29-A30
23. D. Niwinski Equational μ-calculus in: Computation Theory Zaborow, 1984 LNCS 208 1984 Springer pp. 169-176
24. V.R. Pratt Action logic and pure induction in: Logics in AI: European Workshop JELIA '90 LNCS 478 1990 Springer pp. 97-120
25. V.N. Redko On the determining totality of relations for the algebra of regular events Ukrain. Mat. Ž. 16 1964 120-126 (in Russian)
26. D.J. Rosenkrantz Matrix equations and normal forms for context-free grammars J. Assoc. Comput. Mach. 14 1967 501-507
27. A. Salomaa Two complete axiom systems for the algebra of regular events J. Assoc. Comput. Mach. 13 1966 158-169
28. Santocanale On the equational definition of the least prefixed point in: MFCS 2001 LNCS 2136 2001 Springer pp. 645-656