The Kleene-Schützenberger Theorem for Formal Power Series in Partially Commuting Variables

Information and Computation

Volumn 153, Issue 1, 1999, Pages 47-80

  Droste, Manfred ^a   Gastin, Paul ^b  

^a DRESDEN UNIVERSITY OF TECHNOLOGY   (Germany)

^b UNIVERSITÉ PARIS DIDEROT   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0347128778     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1006/inco.1999.2799     Document Type: Article

References (19)

1. Aalbersberg, I. J., and Rozenberg, G. (1988), Theory of traces, Theoret. Comput. Sci. 60, 1-82.
2. Berstel, J., and Reutenauer, Ch. (1988), "Rational Series and Their Languages," EATCS Monographs in Theoretical Computer Science, Vol. 12, Springer-Verlag, New York/Berlin.
3. Cori, R., and Perrin, D. (1985), Automates et commutations partielles, R.A.I.R.O.-Inform. Théor. Appl. 19, 21-32.
4. Diekert, V. (1990), "Combinatorics on Traces," Lecture Notes in Computer Science, Vol. 454, Springer-Verlag, New York/Berlin.
5. Diekert, V., and Métivier, Y. (1997), Partial commutation and traces, in "Handbook on Formal Languages" (G. Rozenberg and A. Salomaa, Eds.), Vol. 3, pp. 457-533, Springer-Verlag, New York/ Berlin.
6. Diekert, V., and Rozenberg, G. (Eds.), (1995), "Book of Traces," World Scientific, Singapore.
7. Droste, M. (1995), Recognizable languages in concurrency monoids, Theoretical Computer Science 150, 77-108.
8. Droste, M., and Gastin, P. (1997), On recognizable and rational formal power series in partially commuting variables., in "Proceedings of the 24th International Colloquium on Automata, Languages and Programming (ICALP'97)" (P. Degano, R. Gorrieri, and A. Marchetti Spaccamela, Eds.), Lecture Notes in Computer Science, Vol. 1256, pp. 682-692, Springer-Verlag, New York/ Berlin.
9. Fliess, M. (1970), Séries reconnaissables, rationnelles et algébriques, Bull. Sci. Math. 94, 231-239.
10. Fliess, M. (1974), Matrices de Hankel, J. Math. Pures Appl. 53, 197-224.
11. Kuich, W. (1997), Semirings and formal power series: Their relevance to formal languages and automata, in "Handbook on Formal Languages" (G. Rozenberg, and A. Salomaa, Eds.), Vol. 1, pp. 609-677, Springer-Verlag, New York/Berlin.
12. Kuich, W., and Salomaa, A. (1986), Semirings, Automata, Languages, EATCS Monographs in Theoretical Computer Science Vol. 6, Springer-Verlag, New York/Berlin.
13. Mazurkiewicz, A. (1977), "Concurrent Program Schemes and Their Interpretations," Tech. Rep., DAIMI PB 78, Aarhus University.
14. Mazurkiewicz, A. (1987), Trace theory, in "Advances in Petri Nets '86" (W. Brauer et al., Eds.), Lecture Notes in Computer Science, Vol. 255, pp. 279-324, Springer-Verlag, New York/Berlin.
15. Ochmański, E. (1985), Regular behaviour of concurrent systems, Bull. Europ. Assoc. Theoret. Comput. Sci. (EATCS) 27, 56-67.
16. Pighizzini, G. (1993), Synthesis of nondeterministic asynchronous automata, in "Semantics of Programming Languages and Model Theory" (M. Droste and Y. Gurevich, Eds.), Algebra, Logic and Applications, Vol. 5, pp. 109-126, Gordon & Breach, New York.
17. Salomaa, A., and Soittola, M. (1978), "Automata-Theoretic Aspects of Formal Power Series.," Texts and Monographs in Computer Science, Springer-Verlag, New York/Berlin.
18. Schützenberger, M. P. (1961), On the definition of a family of automata, Inform. And Control 4, 245-270.
19. Zimmermann, U. (1981), "Linear and Combinatorial Optimization in Ordered Algebraic Structures," Annals of Discrete Mathematics, Vol. 10, North Holland.