@article{DANDO201928,
Abstract = {This paper deals with the conversion of expressions denoting Hadamard series into weighted rotating automata. We prove that any algorithm converting rational series into one-way weighted automata can be extended to provide an algorithm which achieves our goal. We apply this to define the derivation and the follow automata of a Hadamard expression. Our method may also be used to extend algorithms which perform the inverse conversion, but it is required to enhance the algorithm to fulfil some constraints.},
Author = {Dando, Louis-Marie and Lombardy, Sylvain},
File = {From Hadamard expressions to weighted rotating automata and back - 1-s2.0-S0304397518305887-main.pdf},
ISSN = {0304-3975},
Journal = {Theoretical Computer Science},
Keywords = {Weighted automata, Rotating automata, Hadamard product, Rational series},
Note = {Implementation and Application of Automata (CIAA 2017)},
Pages = {28-44},
Title = {From Hadamard expressions to weighted rotating automata and back},
URL = {https://www.sciencedirect.com/science/article/pii/S0304397518305887},
Volume = {787},
Year = {2019},
bdsk-url-1 = {https://www.sciencedirect.com/science/article/pii/S0304397518305887},
bdsk-url-2 = {https://doi.org/10.1016/j.tcs.2018.09.017},
date-added = {2022-06-02 16:30:13 +0200},
date-modified = {2022-06-02 16:30:13 +0200},
doi = {10.1016/j.tcs.2018.09.017}
}
Library Size: 13G (12941 entries),
Last Updated: Apr 04, 2026, 18:14:59,
Build Time: N/A