Finitely ambiguous and finitely sequential weighted automata over fields
From MaRDI portal
Publication:6593669
DOI10.1016/J.TCS.2024.114725MaRDI QIDQ6593669FDOQ6593669
Publication date: 27 August 2024
Published in: Theoretical Computer Science (Search for Journal in Brave)
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?)
- Title not available (Why is that?)
- Handbook of weighted automata
- On the definition of a family of automata
- Sequential?
- A Burnside Approach to the Termination of Mohri's Algorithm for Polynomially Ambiguous Min-Plus-Automata
- Deciding unambiguity and sequentiality from a finitely ambiguous max-plus automaton
- Finite Automata
- Deciding Unambiguity and Sequentiality of Polynomially Ambiguous Min-Plus Automata
- The Generalized Vandermonde Matrix
- On the degree of ambiguity of finite automata
- FINITELY SUBSEQUENTIAL TRANSDUCERS
- Probabilistic automata of bounded ambiguity
- Alternating weighted automata over commutative semirings
- Rational and Recognisable Power Series
- Weighted automata are compact and actively learnable
- Copyless cost-register automata: structure, expressiveness, and closure properties
- Weighted automata
- Ambiguity hierarchies for weighted tree automata
- On Finite and Polynomial Ambiguity of Weighted Tree Automata
- A robust class of linear recurrence sequences
- Noncommutative rational Pólya series
- Finite sequentiality of unambiguous max-plus tree automata
- When are emptiness and containment decidable for probabilistic automata?
- Which Finitely Ambiguous Automata Recognize Finitely Sequential Functions?
- Degree of Sequentiality of Weighted Automata
- Finite ambiguity and finite sequentiality in weighted automata over fields
- Polynomially Ambiguous Probabilistic Automata on Restricted Languages
- An ambiguity hierarchy of weighted context-free grammars
- Polynomially ambiguous unary weighted automata over fields
This page was built for publication: Finitely ambiguous and finitely sequential weighted automata over fields
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6593669)
