A3 Vertaisarvioitu kirjan tai muun kokoomateoksen osa
Integer weighted finite automata, matrices, and formal power series-over Laurent polynomials
Tekijät: Halava V
Toimittaja: J. Karhumäki, H. Maurer, G. Paun, G. Rozenberg
Kustantaja: SPRINGER-VERLAG BERLIN
Julkaisuvuosi: 2004
Lehti:: Lecture Notes in Computer Science
Kokoomateoksen nimi: Theory is Forever
Tietokannassa oleva lehden nimi: THEORY IS FOREVER: ESSAYS DEDICATED TO ARTO SALOMAA ON THE OCCASION OF HIS 70TH BIRTHDAY
Lehden akronyymi: LECT NOTES COMPUT SC
Vuosikerta: 3113
Aloitussivu: 81
Lopetussivu: 88
Sivujen määrä: 8
ISSN: 0302-9743
Tiivistelmä
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.
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.
Turun yliopiston Tutkimustietojärjestelmän portaali