Polynomially ambiguous unary weighted automata over fields

DOI10.1007/s00224-022-10107-7OpenAlexW4308713541MaRDI QIDQ6038711

Peter Kostolányi

Publication date: 2 May 2023

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00224-022-10107-7

zbMATH Keywords

linear recurrencedifference equationformal power seriesfieldweighted automatonpolynomial ambiguity

Mathematics Subject Classification ID

Theory of computing (68Qxx) Theory of software (68Nxx) Computer science (68-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Deciding unambiguity and sequentiality from a finitely ambiguous max-plus automaton
• Handbook of weighted automata
• On the degree of ambiguity of finite automata
• Copyless cost-register automata: structure, expressiveness, and closure properties
• Noncommutative rational Pólya series
• Weighted automata
• Ambiguity hierarchies for weighted tree automata
• Sequential?
• On Finite and Polynomial Ambiguity of Weighted Tree Automata
• Relating the Type of Ambiguity of Finite Automata to the Succinctness of Their Representation
• On the definition of a family of automata
• The Generalized Vandermonde Matrix
• Field Theory
• A Burnside Approach to the Termination of Mohri's Algorithm for Polynomially Ambiguous Min-Plus-Automata
• Semirings and Formal Power Series
• Finite Automata
• Rational and Recognisable Power Series
• Polynomially Ambiguous Probabilistic Automata on Restricted Languages
• Deciding Unambiguity and Sequentiality of Polynomially Ambiguous Min-Plus Automata

This page was built for publication: Polynomially ambiguous unary weighted automata over fields