Degree of Sequentiality of Weighted Automata
From MaRDI portal
Publication:2988370
DOI10.1007/978-3-662-54458-7_13zbMath1396.68075arXiv1701.04632OpenAlexW2578858964MaRDI QIDQ2988370
Didier Villevalois, Ismaël Jecker, Pierre-Alain Reynier, Laure Daviaud
Publication date: 19 May 2017
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1701.04632
Related Items (9)
Unnamed Item ⋮ Degree of Sequentiality of Weighted Automata ⋮ Approximated determinisation of weighted tree automata ⋮ Sequentiality of group-weighted tree automata ⋮ Multi-Sequential Word Relations ⋮ Unnamed Item ⋮ Detectability of labeled weighted automata over monoids ⋮ Finite ambiguity and finite sequentiality in weighted automata over fields ⋮ A Pattern Logic for Automata with Outputs
Cites Work
- Unnamed Item
- Unnamed Item
- Decidability, undecidability, and PSPACE-completeness of the twins property in the tropical semiring
- Une caractérisation des fonctions séquentielles et des fonctions sous- séquentielles en tant que rélations rationnelles
- Determinization of transducers over finite and infinite words.
- Economy of description for single-valued transducers
- Sequential?
- Quantitative languages
- Degree of Sequentiality of Weighted Automata
- On the definition of a family of automata
- Multi-sequential Word Relations
- A Generalised Twinning Property for Minimisation of Cost Register Automata
- Regular Functions and Cost Register Automata
- Decision Problems for Additive Regular Functions
- Deciding Unambiguity and Sequentiality of Polynomially Ambiguous Min-Plus Automata
- Quantitative Languages Defined by Functional Automata
This page was built for publication: Degree of Sequentiality of Weighted Automata
