Determinisability of unary weighted automata over the rational numbers
From MaRDI portal
Publication:2055977
DOI10.1016/j.tcs.2021.11.002zbMath1490.68127MaRDI QIDQ2055977
Publication date: 1 December 2021
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2021.11.002
characteristic polynomial; cyclotomic polynomial; deterministic weighted automaton; reduced representation; sequential weighted automaton
68Q45: Formal languages and automata