Determinisability of unary weighted automata over the rational numbers
From MaRDI portal
Publication:2055977
DOI10.1016/j.tcs.2021.11.002zbMath1490.68127OpenAlexW3213392216MaRDI 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 polynomialcyclotomic polynomialdeterministic weighted automatonreduced representationsequential weighted automaton
Related Items (3)
Bideterministic weighted automata ⋮ Bideterministic weighted automata ⋮ Finite ambiguity and finite sequentiality in weighted automata over fields
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Handbook of weighted automata
- Determinization of weighted finite automata over strong bimonoids
- Fast algorithms for the characteristic polynomial
- Finite automata and unary languages
- On finite semigroups of matrices
- La finitude des représentations linéaires des semi-groupes est decidable
- Noncommutative rational Pólya series
- Crisp-determinization of weighted tree automata over additively locally finite and past-finite monotonic strong bimonoids is decidable
- Weighted automata
- Sequential?
- Gaussian elimination is not optimal
- Approximate formulas for some functions of prime numbers
- On Landau's function g(n)
- Modern Computer Algebra
- Calculating cyclotomic polynomials
- On the definition of a family of automata
- The Generalized Vandermonde Matrix
- Conjugacy and Equivalence of Weighted Automata and Functional Transducers
- Crisp-determinization of weighted tree automata over strong bimonoids
- Semirings and Formal Power Series
- Rational and Recognisable Power Series
- Fuzzy Languages
- Efficient computation of the characteristic polynomial
- Deciding Unambiguity and Sequentiality of Polynomially Ambiguous Min-Plus Automata
- Automata, Languages and Programming
- Algebraic Codes for Data Transmission
This page was built for publication: Determinisability of unary weighted automata over the rational numbers
