Determinisability of unary weighted automata over the rational numbers

DOI10.1016/J.TCS.2021.11.002zbMATH Open1490.68127OpenAlexW3213392216MaRDI QIDQ2055977FDOQ2055977

Peter Kostolányi

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

zbMATH Keywords

characteristic polynomialcyclotomic polynomialdeterministic weighted automatonreduced representationsequential weighted automaton

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Algebraic Codes for Data Transmission
• Gaussian elimination is not optimal
• Handbook of weighted automata
• Fuzzy Languages
• Determinization of weighted finite automata over strong bimonoids
• Approximate formulas for some functions of prime numbers
• On the definition of a family of automata
• On finite semigroups of matrices
• Modern computer algebra
• Sequential?
• Semirings and Formal Power Series
• Finite automata and unary languages
• Conjugacy and Equivalence of Weighted Automata and Functional Transducers
• Automata, Languages and Programming
• Deciding Unambiguity and Sequentiality of Polynomially Ambiguous Min-Plus Automata
• Calculating cyclotomic polynomials
• The Generalized Vandermonde Matrix
• Fast algorithms for the characteristic polynomial
• Efficient computation of the characteristic polynomial
• On Landau's function g(n)
• La finitude des représentations linéaires des semi-groupes est decidable
• Rational and Recognisable Power Series
• Weighted automata
• Noncommutative rational Pólya series
• Crisp-determinization of weighted tree automata over additively locally finite and past-finite monotonic strong bimonoids is decidable
• Crisp-determinization of weighted tree automata over strong bimonoids

Cited In (4)

• Bideterministic weighted automata
• Bideterministic weighted automata
• State estimation for constant-time labeled automata under dense time
• Finite ambiguity and finite sequentiality in weighted automata over fields

This page was built for publication: Determinisability of unary weighted automata over the rational numbers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2055977)