The following pages link to Emmanuel Filiot (Q453495):
Displaying 14 items.
- A Pattern Logic for Automata with Outputs (Q5859645) (← links)
- Synthesis of Data Word Transducers (Q5875385) (← links)
- Two-Way Parikh Automata (Q5875675) (← links)
- Quantitative Languages Defined by Functional Automata (Q5891775) (← links)
- Quantitative Languages Defined by Functional Automata (Q5895229) (← links)
- Decidable weighted expressions with Presburger combinators (Q5915759) (← links)
- Church synthesis on register automata over linearly ordered data domains (Q6151760) (← links)
- (Q6187060) (← links)
- Synthesizing Computable Functions from Rational Specifications Over Infinite Words (Q6195088) (← links)
- LTL reactive synthesis with a few hints (Q6536136) (← links)
- A generic solution to register-bounded synthesis with an application to discrete orders (Q6560924) (← links)
- Two-player boundedness counter games (Q6587129) (← links)
- A regular and complete notion of delay for streaming string transducers (Q6615140) (← links)
- Deterministic regular functions of Infinite words (Q6638130) (← links)
