Clique polynomials have a unique root of smallest modulus

Information Processing Letters

Volumn 75, Issue 3, 2000, Pages 127-132

  Goldwurm, Massimiliano ^a   Santini, Massimo ^a  

^a UNIVERSITY OF MILAN   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; FORMAL LANGUAGES; FUNCTIONS; GRAPH THEORY; MATHEMATICAL MODELS;

CLIQUE POLYNOMIALS; RATIONAL FUNCTIONS; TRACE MONOIDS;

POLYNOMIALS;

EID: 0034247324     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0020-0190(00)00086-7     Document Type: Article

References (16)

1. Avellone A., Goldwurm M. Analysis of algorithms for the recognition of rational and context-free trace languages. Theoret. Inform. Appl. Vol. 32:1998;141-152.
2. Béal M.-P. Codage Symbolique. 1993;Masson, Paris.
3. Berstel J., Reutenauer C. Rational Series and Their Languages. 1988;Springer, New York.
4. Bertoni A., Goldwurm M., Sabadini N. Analysis of a class of algorithms for problems on trace languages. Beth Th., Clausen M. Applicable Algebra, Error-Correcting Codes, Combinatorics and Computer Algebra (Proceedings AAECC 4), Karlsruhe (FRG), September 23-26, 1986. Lecture Notes in Computer Science. Vol. 307:1988;202-214 Springer, Berlin.
5. Bertoni A., Mauri G., Sabadini N. Membership problems for regular and context free trace languages. Inform. and Comput. Vol. 82:1989;135-150.
6. Cartier P., Foata D. Problèmes Combinatoires de Commutation et Réarrangements. Lecture Notes in Mathematics. Vol. 85:1969;Springer, Berlin.
7. Cartwright D., Harary F., Norman R. Structural Models: An Introduction to the Theory of Directed Graphs. 1965;John Wiley & Sons, New York.
8. Choffrut C., Goldwurm M. Determinants and Möbius functions in trace monoids. Discrete Math. Vol. 194:1999;239-247.
9. Diekert V. Möbius functions and confluent semi-commutations. Theoret. Comput. Sci. Vol. 108:1993;25-43.
10. Diekert V., Kobayashi Y. Some identities related to automata, determinants, and Möbius functions. Nehaniv C.L., Ito M. Algebraic Engineering, Proc. Internat. Workshop on Formal Languages and Computer Systems, Kyoto, Japan, 18-21 March, 1997, and the 1st Internat. Conference on Semigroups and Algebraic Engineering, Aizu, Japan, 24-28 March, 1997. 1997;330-349 World Scientific, Singapore.
11. Diekert V., Métivier Y. Partial commutation and traces. Rozenberg G., Salomaa A. Handbook of Formal Languages: Beyond Words. 1997;457-534 Springer, Berlin.
12. Diekert V., Rozenberg G. The Book of Traces. 1995;World Scientific, Singapore.
13. Goldwurm M., Saporiti L. Clique polynomials and trace monoids, Rapporto Interno No. 222-98. 1998;Dip. Scienze dell'Informazione, Università degli Studi di Milano.
14. Salomaa A., Soittola M. Automata-Theoretic Aspects of Formal Power Series. 1978;Springer, New York.
15. Seneta E. Non-Negative Matrices and Markov Chains. 1981;Springer, New York.
16. Shilov G.E. Linear Algebra. 1977;Dover Publications, New York.