Integer weighted finite automata, matrices, and formal power series-over Laurent polynomials



: Halava V

: J. Karhumäki, H. Maurer, G. Paun, G. Rozenberg

Publisher: SPRINGER-VERLAG BERLIN

: 2004

 Lecture Notes in Computer Science

: Theory is Forever

: THEORY IS FOREVER: ESSAYS DEDICATED TO ARTO SALOMAA ON THE OCCASION OF HIS 70TH BIRTHDAY

: LECT NOTES COMPUT SC

: 3113

: 81

: 88

: 8

: 0302-9743


It is Well known that the family of regular languages (over alphabet A), accepted by finite automata, coincides with the set of supports of the rational and recognizable formal power series over N with the set of variables A. Here we prove that there is a corresponding presentation for languages accepted by integer weighted finite automata, where the weights are from the additive group of integers, via the matrices over Laurent polynomials with integer coefficients.



Last updated on 14/10/2025 09:48:40 AM