|
Search the dblp DataBase
Véronique Bruyère:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Isabel M. Araújo, Véronique Bruyère
Sturmian Words: Dynamical Systems and Derivated Words. [Citation Graph (0, 0)][DBLP] Developments in Language Theory, 2005, pp:122-133 [Conf]
- Véronique Bruyère, Olivier Carton
Automata on Linear Orderings. [Citation Graph (0, 0)][DBLP] Developments in Language Theory, 2002, pp:103-115 [Conf]
- Thomas Brihaye, Véronique Bruyère, Jean-François Raskin
Model-Checking for Weighted Timed Automata. [Citation Graph (0, 0)][DBLP] FORMATS/FTRTFT, 2004, pp:277-292 [Conf]
- Thomas Brihaye, Véronique Bruyère, Jean-François Raskin
On Optimal Timed Strategies. [Citation Graph (0, 0)][DBLP] FORMATS, 2005, pp:49-64 [Conf]
- Véronique Bruyère, Jean-François Raskin
Real-Time Model-Checking: Parameters Everywhere. [Citation Graph (0, 0)][DBLP] FSTTCS, 2003, pp:100-111 [Conf]
- Véronique Bruyère
Completion of Finite Codes with Finite Deciphering Delay. [Citation Graph (0, 0)][DBLP] ICALP, 1989, pp:151-163 [Conf]
- Véronique Bruyère
A Completion Algorithm for Codes with Bounded Synchronization Delay. [Citation Graph (0, 0)][DBLP] ICALP, 1997, pp:87-97 [Conf]
- Véronique Bruyère, Clelia de Felice
Degree and Decomposability of Variable-Length Codes. [Citation Graph (0, 0)][DBLP] ICALP, 1991, pp:575-587 [Conf]
- Véronique Bruyère, Michel Latteux
Variable-Length Maximal Codes. [Citation Graph (0, 0)][DBLP] ICALP, 1996, pp:24-47 [Conf]
- Véronique Bruyère, Olivier Carton
Hierarchy Among Automata on Linear Orderings. [Citation Graph (0, 0)][DBLP] IFIP TCS, 2002, pp:107-118 [Conf]
- Véronique Bruyère
Automata and Codes with Bounded Deciphering Delay. [Citation Graph (0, 0)][DBLP] LATIN, 1992, pp:99-107 [Conf]
- Véronique Bruyère, Georges Hansel
Recognizable Sets of Numbers in Nonstandard Bases. [Citation Graph (0, 0)][DBLP] LATIN, 1995, pp:167-179 [Conf]
- Véronique Bruyère, Olivier Carton
Automata on Linear Orderings. [Citation Graph (0, 0)][DBLP] MFCS, 2001, pp:236-247 [Conf]
- Véronique Bruyère
On Maximal Prefix Sets of Words. [Citation Graph (0, 0)][DBLP] MFCS, 1988, pp:201-209 [Conf]
- Véronique Bruyère, Emmanuel Dall'Olio, Jean-François Raskin
Durations, Parametric Model-Checking in Timed Automata with Presburger Arithmetic. [Citation Graph (0, 0)][DBLP] STACS, 2003, pp:687-698 [Conf]
- Véronique Bruyère, Clelia de Felice
Coding and Strong Coding in Trace Monoids. [Citation Graph (0, 0)][DBLP] STACS, 1995, pp:373-384 [Conf]
- Véronique Bruyère, Clelia de Felice, Giovanna Guaiana
Coding with Traces. [Citation Graph (0, 0)][DBLP] STACS, 1994, pp:353-364 [Conf]
- Véronique Bruyère, Clelia de Felice
Any Lifting of a Trace Coding is a Word Coding. [Citation Graph (0, 0)][DBLP] Inf. Comput., 1996, v:130, n:2, pp:183-193 [Journal]
- Thomas Brihaye, Véronique Bruyère, Jean-François Raskin
On model-checking timed automata with stopwatch observers. [Citation Graph (0, 0)][DBLP] Inf. Comput., 2006, v:204, n:3, pp:408-433 [Journal]
- Véronique Bruyère
Factorisation Des Ensembles Préfixiels. [Citation Graph (0, 0)][DBLP] ITA, 1989, v:23, n:3, pp:295-315 [Journal]
- Véronique Bruyère, Clelia de Felice
On the Existence of Codings Between Trace Monoids. [Citation Graph (0, 0)][DBLP] Journal of Automata, Languages and Combinatorics, 1999, v:4, n:2, pp:87-100 [Journal]
- Véronique Bruyère, Olivier Carton
Automata on linear orderings. [Citation Graph (0, 0)][DBLP] J. Comput. Syst. Sci., 2007, v:73, n:1, pp:1-24 [Journal]
- Véronique Bruyère
About prefix sets of words. [Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. A, 1989, v:51, n:2, pp:237-243 [Journal]
- Véronique Bruyère, Olivier Carton
Hierarchy Among Automata on Linear Orderings. [Citation Graph (0, 0)][DBLP] Theory Comput. Syst., 2005, v:38, n:5, pp:593-621 [Journal]
- F. Point, Véronique Bruyère
On the Cobham-Semenov Theorem. [Citation Graph (0, 0)][DBLP] Theory Comput. Syst., 1997, v:30, n:2, pp:197-220 [Journal]
- Isabel M. Araújo, Véronique Bruyère
Sturmian words and a criterium by Michaux-Villemaire. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2005, v:339, n:1, pp:88-102 [Journal]
- Isabel M. Araújo, Véronique Bruyère
Words derivated from Sturmian words. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2005, v:340, n:1, pp:204-219 [Journal]
- Véronique Bruyère
Cumulative defect. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2003, v:292, n:1, pp:97-109 [Journal]
- Véronique Bruyère
An Answer to a Question about Finite Maximal Prefix Sets of Words. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 1988, v:56, n:, pp:339-344 [Journal]
- Véronique Bruyère
Maximal Codes With Bounded Deciphering Delay. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 1991, v:84, n:1, pp:53-76 [Journal]
- Véronique Bruyère
On Maximal Codes with Bounded Synchronization Delay. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 1998, v:204, n:1-2, pp:11-28 [Journal]
- Véronique Bruyère, Denis Derencourt, Michel Latteux
The Meet Operation in the Lattice of Codes. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 1998, v:191, n:1-2, pp:117-129 [Journal]
- Véronique Bruyère, Clelia de Felice, Giovanna Guaiana
On Some Decision Problems for Trace Codings. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 1995, v:148, n:2, pp:227-260 [Journal]
- Véronique Bruyère, Georges Hansel
Bertrand Numeration Systems and Recognizability. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 1997, v:181, n:1, pp:17-43 [Journal]
- Véronique Bruyère, Dominique Perrin
Maximal Bifix Codes. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 1999, v:218, n:1, pp:107-121 [Journal]
- Véronique Bruyère, Christophe Reutenauer
A Proof of Choffrut's Theorem on Subsequential Functions. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 1999, v:215, n:1-2, pp:329-335 [Journal]
- Véronique Bruyère, Jean-François Raskin
Real-Time Model-Checking: Parameters everywhere [Citation Graph (0, 0)][DBLP] CoRR, 2007, v:0, n:, pp:- [Journal]
- Véronique Bruyère, Clelia de Felice
Synchronization and decomposability for a family of codes: Part 2. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1995, v:140, n:1-3, pp:47-77 [Journal]
- Patricia Bouyer, Thomas Brihaye, Véronique Bruyère, Jean-François Raskin
On the optimal reachability problem of weighted timed automata. [Citation Graph (0, 0)][DBLP] Formal Methods in System Design, 2007, v:31, n:2, pp:135-175 [Journal]
Equilibria in Quantitative Reachability Games. [Citation Graph (, )][DBLP]
On the Sets of Real Numbers Recognized by Finite Automata in Multiple Bases. [Citation Graph (, )][DBLP]
On First-Order Query Rewriting for Incomplete Database Histories. [Citation Graph (, )][DBLP]
Turán Graphs, Stability Number, and Fibonacci Index. [Citation Graph (, )][DBLP]
Turán Graphs, Stability Number, and Fibonacci Index [Citation Graph (, )][DBLP]
Fibonacci Index and Stability Number of Graphs: a Polyhedral Study [Citation Graph (, )][DBLP]
On the Sets of Real Numbers Recognized by Finite Automata in Multiple Bases [Citation Graph (, )][DBLP]
Foreword to the Special Issue Dedicated to the 10th "Journées Montoises d'Informatique Théorique". [Citation Graph (, )][DBLP]
Search in 0.003secs, Finished in 0.308secs
|