#### Filter Results:

- Full text PDF available (10)

#### Publication Year

2013

2017

- This year (5)
- Last 5 years (12)
- Last 10 years (12)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Thomas Colcombet, Laure Daviaud, Florian Zuleger
- MFCS
- 2014

Max-plus automata (over N âˆª {âˆ’âˆž}) are nite devices that map input words to non-negative integers or âˆ’âˆž. In this paper we present (a) an algorithm allowing to compute the asymptotic behaviour ofâ€¦ (More)

Weighted automata (WA) extend finite-state automata by associating with transitions weights from a semiring S, defining functions from words to S. Recently, cost register automata (CRA) have beenâ€¦ (More)

- Thomas Colcombet, Laure Daviaud
- Theory of Computing Systems
- 2015

Distance automata are automata weighted over the semiring ( â„• âˆª { âˆž } , min , + ) $(\mathbb {N}\cup \{\infty \},\min , +)$ (the tropical semiring). Such automata compute functions from words to â„• âˆª {â€¦ (More)

- Mikolaj Bojanczyk, Laure Daviaud, Bruno Guillon, Vincent Penelle
- ICALP
- 2017

We study various models of transducers equipped with origin information. We consider the semantics of these models as particular graphs, called origin graphs, and we characterise the families of suchâ€¦ (More)

- Laure Daviaud, Charles Paperman
- MFCS
- 2015

In this paper, we study the lattice and the Boolean algebra, possibly closed under quotient, generated by the languages of the form uâˆ—, where u is a word. We provide effective equationalâ€¦ (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â€¦ (More)

- Amphi Chavre, Daniel Stan LSV, +5 authors Bastien Maubert
- 2016

FÃ©lix Baschenis (LaBRI, UniversitÃ© de Bordeaux): Ressource Minimization and One-Way Definability of Two-Way Transducers While adding to automata the possibility of their reading head to move freelyâ€¦ (More)

- Laure Daviaud, Marianne Johnson
- MFCS
- 2017

Max-plus automata are quantitative extensions of automata designed to associate an integer with every non empty word. A pair of distinct words is said to be an identity for a class of max-plusâ€¦ (More)

- Thomas Colcombet, Laure Daviaud
- STACS
- 2013

Distance automata are automata weighted over the semiring (N âˆª {âˆž},min,+) (the tropical semiring). Such automata compute functions from words to N âˆª {âˆž} such as the number of occurrences of a givenâ€¦ (More)

- Thomas Colcombet, Laure Daviaud, Florian Zuleger
- FCT
- 2017

We show how recent results concerning quantitative forms of automata help providing refined understanding of the properties of a system (for instance, a program). In particular, combining theâ€¦ (More)