A3 Refereed book chapter or chapter in a compilation book
Integer weighted finite automata, matrices, and formal power series-over Laurent polynomials
Authors: Halava V
Editors: J. Karhumäki, H. Maurer, G. Paun, G. Rozenberg
Publisher: SPRINGER-VERLAG BERLIN
Publication year: 2004
Journal:: Lecture Notes in Computer Science
Book title : Theory is Forever
Journal name in source: THEORY IS FOREVER: ESSAYS DEDICATED TO ARTO SALOMAA ON THE OCCASION OF HIS 70TH BIRTHDAY
Journal acronym: LECT NOTES COMPUT SC
Volume: 3113
First page : 81
Last page: 88
Number of pages: 8
ISSN: 0302-9743
Abstract
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.
UTU Research Portal