The following pages link to Sylvain Lombardy (Q703496):
Displayed 45 items.
- Introducing VAUCANSON (Q703498) (← links)
- Deciding unambiguity and sequentiality from a finitely ambiguous max-plus automaton (Q703577) (← links)
- Embeddings of local automata (Q716395) (← links)
- Two-way automata over locally finite semirings (Q777989) (← links)
- The validity of weighted automata (Q1616952) (← links)
- Two routes to automata minimization and the ways to reach it efficiently (Q1616978) (← links)
- Derivatives of rational expressions with multiplicity (Q1770384) (← links)
- Max-plus automata (Q2074207) (← links)
- Sequential? (Q2490822) (← links)
- On Determinism and Unambiguity of Weighted Two-Way Automata (Q2800415) (← links)
- (Q2819379) (← links)
- THE VALIDITY OF WEIGHTED AUTOMATA (Q2842025) (← links)
- Implementing Computations in Automaton (Semi)groups (Q2914713) (← links)
- Factor and Subsequence Kernels and Signatures of Rational Languages (Q2914720) (← links)
- The Removal of Weighted ε-Transitions (Q2914724) (← links)
- Two-way representations and weighted automata (Q2969983) (← links)
- (Q3044317) (← links)
- Corrigendum to our paper: How Expressions Can Code for Automata (Q3060202) (← links)
- (Q3086930) (← links)
- Decidability of Geometricity of Regular Languages (Q3167484) (← links)
- Tropical Two-Way Automata (Q3190161) (← links)
- A Type System for Weighted Automata and Rational Expressions (Q3192261) (← links)
- Series which are both max-plus and min-plus rational are unambiguous (Q3374753) (← links)
- Conjugacy and Equivalence of Weighted Automata and Functional Transducers (Q3434682) (← links)
- Radix Cross-Sections for Length Morphisms (Q3557020) (← links)
- Regular Temporal Cost Functions (Q3587468) (← links)
- On the Size of the Universal Automaton of a Regular Language (Q3590923) (← links)
- (Q4452077) (← links)
- How expressions can code for automata (Q4680737) (← links)
- (Q4708596) (← links)
- (Q4737155) (← links)
- (Q4994944) (← links)
- On Hadamard Series and Rotating Q-Automata (Q5005101) (← links)
- Morphisms and Minimisation of Weighted Automata (Q5038573) (← links)
- FACTORIZATIONS AND UNIVERSAL AUTOMATON OF OMEGA LANGUAGES (Q5247178) (← links)
- Factorizations and Universal Automaton of Omega Languages (Q5300852) (← links)
- Implementation Concepts in Vaucanson 2 (Q5327488) (← links)
- Deciding Unambiguity and Sequentiality of Polynomially Ambiguous Min-Plus Automata (Q5390010) (← links)
- Automata, Languages and Programming (Q5716792) (← links)
- (Q5874305) (← links)
- Implementation and Application of Automata (Q5897670) (← links)
- LATIN 2004: Theoretical Informatics (Q5901644) (← links)
- From Hadamard expressions to weighted rotating automata and back (Q5919578) (← links)
- From Hadamard expressions to weighted rotating automata and back (Q5920056) (← links)
- The net automaton of a rational expression (Q6109019) (← links)