Determinants and Möbius functions in trace monoids

Discrete Mathematics

Volumn 194, Issue 1-3, 1999, Pages 239-247

  Choffrut, Christian ^a   Goldwurm, Massimiliano ^b  

^a UNIVERSITÉ PARIS DESCARTES   (France)

^b UNIVERSITY OF MILAN   (Italy)

Author keywords

Determinants; M bius function; Rational formal series; Trace monoids

Indexed keywords

EID: 0043209401     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0012-365X(98)00211-8     Document Type: Article

References (11)

1. J. Berstel, Transductions and Context-free Languages, B.G. Teubner, Stuttgart, 1979.
2. A. Bertoni, M. Goldwurm, N. Sabadini, Analysis of a class of algorithms for problems on trace languages, Proc. 4th AAECC, Lecture Notes in Computer Science, vol. 307, Springer, Berlin, 1988, pp. 202-214.
3. P. Cartier, D. Foata, Problèmes combinatoires de commutation et réarrangements, Lecture Notes in Mathematics, vol. 85, Springer, Berlin, 1969.
4. A. Choffrut, Free partially commutative monoids, Technical Report 86/20 LITP, Université Paris 7, 1986.
5. V. Diekert, Transitive orientations, Möbius functions and complete semi-Thue systems for free partially commutative monoids, Proc. 15th ICALP, Lecture Notes in Computer Science, vol. 317, Springer, Berlin, 1988, pp. 176-187.
6. V. Diekert, Combinatorics on traces, Lecture Notes in Computer Science, vol. 454, Springer, Berlin, 1988.
7. V. Diekert, Möbius functions and confluent semi-commutations, Theoret. Comput. Sci. 108 (1993) 25-43.
8. V. Diekert, G. Rozenberg, (eds.), The Book of Traces, World Scientific, Singapore, 1995.
9. S. Eilenberg, Automata, Languages and Machines, vol. A Academic Press, New York, 1974.
10. G. Lallement, Semigroups and Combinatorial Applications, Wiley, New York, 1979.
11. A. Mazurkiewicz, Concurrent program schemes and their interpretations, DAIMI Rep. PB 78, Aarhus University, 1977.