Finitely ambiguous and finitely sequential weighted automata over fields
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 193132 (Why is no real title available?)
- scientific article; zbMATH DE number 3458752 (Why is no real title available?)
- scientific article; zbMATH DE number 3588051 (Why is no real title available?)
- scientific article; zbMATH DE number 1970438 (Why is no real title available?)
- scientific article; zbMATH DE number 2171469 (Why is no real title available?)
- scientific article; zbMATH DE number 7559164 (Why is no real title available?)
- scientific article; zbMATH DE number 7561720 (Why is no real title available?)
- scientific article; zbMATH DE number 7407779 (Why is no real title available?)
- scientific article; zbMATH DE number 7650822 (Why is no real title available?)
- A Burnside Approach to the Termination of Mohri's Algorithm for Polynomially Ambiguous Min-Plus-Automata
- A robust class of linear recurrence sequences
- Alternating weighted automata over commutative semirings
- Ambiguity hierarchies for weighted tree automata
- An ambiguity hierarchy of weighted context-free grammars
- Copyless cost-register automata: structure, expressiveness, and closure properties
- Deciding unambiguity and sequentiality from a finitely ambiguous max-plus automaton
- Deciding unambiguity and sequentiality of polynomially ambiguous min-plus automata
- Degree of sequentiality of weighted automata
- Elements of automata theory. Translated from the French by Reuben Thomas
- FINITELY SUBSEQUENTIAL TRANSDUCERS
- Finite ambiguity and finite sequentiality in weighted automata over fields
- Finite automata
- Finite sequentiality of unambiguous max-plus tree automata
- Handbook of weighted automata
- Noncommutative rational Pólya series
- Noncommutative rational series with applications
- On finite and polynomial ambiguity of weighted tree automata
- On the definition of a family of automata
- On the degree of ambiguity of finite automata
- Polynomially Ambiguous Probabilistic Automata on Restricted Languages
- Polynomially ambiguous unary weighted automata over fields
- Probabilistic automata of bounded ambiguity
- Rational and Recognisable Power Series
- Sequential?
- The Generalized Vandermonde Matrix
- Weighted automata
- Weighted automata are compact and actively learnable
- When are emptiness and containment decidable for probabilistic automata?
- Which finitely ambiguous automata recognize finitely sequential functions? (extended abstract)
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)
