On recognizable and rational formal power series in partially commuting variables

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1256, Issue , 1997, Pages 682-692

  Droste, Manfred ^a   Gastin, Paul ^b  

^a DRESDEN UNIVERSITY OF TECHNOLOGY   (Germany)

^b UNIVERSITÉ PIERRE ET MARIE CURIE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY;

FORMAL POWER SERIES; IDEMPOTENT; MONOIDS; RATIONAL FORMAL POWER SERIES; RATIONAL POWER SERIES; RECOGNIZABLE SERIES; SEMI-RING; SEMIRINGS;

STARS;

EID: 33749704789     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-63165-8_222     Document Type: Conference Paper

References (15)

1. I.J. Aalbersberg and G. Rozenberg. Theory of traces. Theoretical Computer Science, 60:1-82, 1988.
2. J. Berstel and Ch. Rentenalter. Rational Series and Their Languages, volume 12 of EATCS Monographs in Theoretical Computer Science. Springer Verlag, 1988.
3. Ch. Choffrut. Free partially commutative monoids. Rapport LITP 86.20, Üniversite Paris 7 (France), 1986.
4. V. Dickert. Combinatorics on Traces. Number 454 in Lecture Notes in Computer Science. Springer Verlag, 1990.
5. V. Diekert and Y. Métivier. Partial commutation and traces. In G. Rozenberg and A. Salomaa, editors, Handbook on Formal Languages, volume 3. Springer Verlag. To appear.
6. V. Diekert and G. Rozenberg, editors. Book of Traces. World Scientific, Singapore, 1995.
7. M. Fliess. Matrices de Hankel. J. Math. Pures et Appl, 53:197-224, 1974.
8. W. Kuich. Semirings and formal power series: Their relevance to formal languages and automata. In Handbook on Formal Languages. Springer Verlag, 1997. To appear.
9. W. Kuich and A. Salomaa. Semirings, Automata, Languages, volume 6 of EATCS Monographs in Theoretical Computer Science. Springer Verlag, 1986.
10. A. Mazurkiewicz. Concurrent program schemes and their interpretations. Tech. rep. DAIMI PB 78, Aarlms University, 1977.
11. A. Mazurkiewicz. Trace theory. In W. Brauer et al., editors, Advances in Petri Nets ‘86, number 255 in Lecture Notes in Computer Science, pages 279-324. Springer Verlag, 1987.
12. E. Oclmıanski. Regular behaviour of concurrent systems. Bulletin of the European Association for Theoretical Computer Science (EATCS), 27:56-67, Oct 1985.
13. G. Pighizzini. Synthesis of nondeterministic asynchronous automata. In M. Droste and Y. Gurevich, editors, Semantics of Programming Languages and Model Theory, number 5 in Algebra, Logic and Applications, pages 109-126. Gordon and Breach Science Publ, 1993.
14. A. Salomaa and M. Soittola. Automata-Theoretic Aspects of Formal Power Series, Texts and Monographs in Computer Science. Springer Verlag, 1978.
15. M.P. Schützenberger. On the definition of a family of automata. Information and Control, 4:245-270, 1961.