#### Filter Results:

- Full text PDF available (5)

#### Publication Year

2015

2017

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Emmanuel Filiot, Ismaël Jecker, Christof Löding, Sarah Winter
- ICALP
- 2016

Transductions are binary relations of finite words. For rational transductions, i.e., transductions defined by finite transducers, the inclusion, equivalence and sequential uniformisation problems are known to be undecidable. In this paper, we investigate stronger variants of inclusion, equivalence and sequential uniformisation, based on a general notion of… (More)

- Luc Dartois, Ismaël Jecker, Pierre-Alain Reynier
- DLT
- 2016

- Ismaël Jecker, Emmanuel Filiot
- DLT
- 2015

Rational relations are binary relations of finite words that are realised by non-deterministic finite state transducers (NFT). A particular kind of rational relations is the sequential functions. Sequential functions are the functions that can be realised by input-deterministic transducers. Some rational functions are not sequential. However, based on a… (More)

- Laure Daviaud, Ismaël Jecker, Pierre-Alain Reynier, Didier Villevalois
- FoSSaCS
- 2017

Weighted automata (WA) are an important formalism to describe quantitative properties. Obtaining equivalent deterministic machines is a longstanding research problem. In this paper we consider WA with a set semantics, meaning that the semantics is given by the set of weights of accepting runs. We focus on multi-sequential WA that are defined as finite… (More)

- Luc Dartois, Paulin Fournier, Ismaël Jecker, Nathan Lhote
- ArXiv
- 2017

Deterministic two-way transducers define the robust class of regular functions which is, among other good properties, closed under composition. However, the best known algorithms for composing two-way transducers cause a double exponential blow-up in the size of the inputs. In this paper, we introduce a class of transducers for which the composition has… (More)

Decidability of the determinization problem for weighted automata over the semiring (Z∪{−∞}, max, +), WA for short, is a long-standing open question. We propose two ways of approaching it by constraining the search space of deterministic WA: k-delay and r-regret. A WA N is k-delay determinizable if there exists a deterministic automaton D that defines the… (More)

- ‹
- 1
- ›