Noncommutative rational Pólya series
Keyword(s):
AbstractA (noncommutative) Pólya series over a field K is a formal power series whose nonzero coefficients are contained in a finitely generated subgroup of $$K^\times $$ K × . We show that rational Pólya series are unambiguous rational series, proving a 40 year old conjecture of Reutenauer. The proof combines methods from noncommutative algebra, automata theory, and number theory (specifically, unit equations). As a corollary, a rational series is a Pólya series if and only if it is Hadamard sub-invertible. Phrased differently, we show that every weighted finite automaton taking values in a finitely generated subgroup of a field (and zero) is equivalent to an unambiguous weighted finite automaton.
Keyword(s):
2005 ◽
Vol 2005
(23)
◽
pp. 3767-3780
Keyword(s):
2001 ◽
Vol 64
(1)
◽
pp. 13-28
◽
2003 ◽
Vol 184
(2)
◽
pp. 369-383
◽
Keyword(s):
2004 ◽
Vol 339
(8)
◽
pp. 533-538
◽
2002 ◽
Vol 51
(3)
◽
pp. 403-410
◽
2017 ◽
Vol 2018
(15)
◽
pp. 4780-4798
◽