| 2008 |
|---|
| 38 | EE | Marie-Pierre Béal,
Dominique Perrin:
A quadratic algorithm for road coloring
CoRR abs/0803.0726: (2008) |
| 37 | EE | Marie-Pierre Béal,
Eugen Czeizler,
Jarkko Kari,
Dominique Perrin:
Unambiguous Automata.
Mathematics in Computer Science 1(4): 625-638 (2008) |
| 2007 |
|---|
| 36 | EE | Marie-Pierre Béal,
Fabio Burderi,
Antonio Restivo:
Coding Partitions: Regularity, Maximality and Global Ambiguity.
Developments in Language Theory 2007: 48-59 |
| 2006 |
|---|
| 35 | EE | Marie-Pierre Béal,
Sylvain Lombardy,
Jacques Sakarovitch:
Conjugacy and Equivalence of Weighted Automata and Functional Transducers.
CSR 2006: 58-69 |
| 34 | EE | Marie-Pierre Béal,
Dominique Perrin:
Complete Codes in a Sofic Shift.
STACS 2006: 127-136 |
| 33 | EE | Marie-Pierre Béal,
Francesca Fiorenzi,
Dominique Perrin:
The Syntactic Graph of a Sofic Shift Is Invariant under Shift Equivalence.
IJAC 16(3): 443-460 (2006) |
| 32 | EE | Marie-Pierre Béal,
Dominique Perrin:
Codes, unambiguous automata and sofic systems.
Theor. Comput. Sci. 356(1-2): 6-13 (2006) |
| 2005 |
|---|
| 31 | EE | Marie-Pierre Béal,
Sylvain Lombardy,
Jacques Sakarovitch:
On the Equivalence of -Automata.
ICALP 2005: 397-409 |
| 30 | EE | Marie-Pierre Béal,
Maxime Crochemore,
Gabriele Fici:
Presentations of constrained systems with unconstrained positions.
IEEE Transactions on Information Theory 51(5): 1891-1900 (2005) |
| 29 | EE | Marie-Pierre Béal,
Francesca Fiorenzi,
Filippo Mignosi:
Minimal Forbidden Patterns of Multi-Dimensional Shifts.
IJAC 15(1): 73-93 (2005) |
| 28 | EE | Marie-Pierre Béal,
Dominique Perrin:
Codes and sofic constraints.
Theor. Comput. Sci. 340(1): 381-393 (2005) |
| 27 | EE | Marie-Pierre Béal,
Francesca Fiorenzi,
Dominique Perrin:
A hierarchy of shift equivalent sofic shifts.
Theor. Comput. Sci. 345(2-3): 190-205 (2005) |
| 2004 |
|---|
| 26 | EE | Marie-Pierre Béal,
Francesca Fiorenzi,
Dominique Perrin:
A Hierarchy of Irreducible Sofic Shifts.
MFCS 2004: 611-622 |
| 25 | EE | Marie-Pierre Béal,
Francesca Fiorenzi,
Dominique Perrin:
The Syntactic Graph of a Sofic Shift.
STACS 2004: 282-293 |
| 24 | EE | Marie-Pierre Béal,
Anne Bergeron,
Sylvie Corteel,
Mathieu Raffinot:
An algorithmic view of gene teams.
Theor. Comput. Sci. 320(2-3): 395-418 (2004) |
| 23 | EE | Marie-Pierre Béal,
Olivier Carton:
Determinization of Transducers over Infinite Words: The General Case.
Theory Comput. Syst. 37(4): 483-502 (2004) |
| 2003 |
|---|
| 22 | EE | Marie-Pierre Béal,
Maxime Crochemore,
Filippo Mignosi:
Computing forbidden words of regular languages.
Fundam. Inform. 56(1-2): 121-135 (2003) |
| 21 | | Marie-Pierre Béal:
Extensions of the method of poles for code construction.
IEEE Transactions on Information Theory 49(6): 1516-1523 (2003) |
| 20 | EE | Marie-Pierre Béal,
Dominique Perrin:
On the generating sequences of regular languages on k symbols.
J. ACM 50(6): 955-980 (2003) |
| 19 | | Marie-Pierre Béal,
Olivier Carton,
Christophe Prieur,
Jacques Sakarovitch:
Squaring transducers: an efficient procedure for deciding functionality and sequentiality.
Theor. Comput. Sci. 292(1): 45-63 (2003) |
| 2002 |
|---|
| 18 | EE | Marie-Pierre Béal,
Dominique Perrin:
On the Enumerative Sequences of Regular Languages on k Symbols.
STACS 2002: 547-558 |
| 17 | | Marie-Pierre Béal,
Olivier Carton:
Determinization of transducers over finite and infinite words.
Theor. Comput. Sci. 289(1): 225-251 (2002) |
| 2000 |
|---|
| 16 | EE | Marie-Pierre Béal,
Olivier Carton:
Determinization of Transducers over Infinite Words.
ICALP 2000: 561-570 |
| 15 | | Marie-Pierre Béal,
Olivier Carton,
Christophe Prieur,
Jacques Sakarovitch:
Squaring Transducers: An Efficient Procedure for Deciding Functionality and Sequentiality of Transducers.
LATIN 2000: 397-406 |
| 14 | | Marie-Pierre Béal,
Olivier Carton:
Asynchronous sliding block maps.
ITA 34(2): 139-156 (2000) |
| 13 | EE | Marie-Pierre Béal,
Olivier Carton:
Computing the prefix of an automaton.
ITA 34(6): 503-514 (2000) |
| 12 | EE | Frédérique Bassino,
Marie-Pierre Béal,
Dominique Perrin:
A Finite State Version of the Kraft--McMillan Theorem.
SIAM J. Comput. 30(4): 1211-1230 (2000) |
| 1999 |
|---|
| 11 | | Marie-Pierre Béal,
Olivier Carton:
Asynchronous sliding block maps.
Developments in Language Theory 1999: 47-59 |
| 10 | EE | Frédérique Bassino,
Marie-Pierre Béal,
Dominique Perrin:
Enumerative Sequences of Leaves and Nodes in Rational Trees.
Theor. Comput. Sci. 221(1-2): 41-60 (1999) |
| 1998 |
|---|
| 9 | EE | Frédérique Bassino,
Marie-Pierre Béal,
Dominique Perrin:
Super-State Automata and Rational Trees.
LATIN 1998: 42-52 |
| 8 | EE | Marie-Pierre Béal,
Jean Senellart:
On the Bound of the Synchronization Delay of a Local Automaton.
Theor. Comput. Sci. 205(1-2): 297-306 (1998) |
| 1997 |
|---|
| 7 | | Frédérique Bassino,
Marie-Pierre Béal,
Dominique Perrin:
Enumerative Sequences of Leaves in Rational Trees.
ICALP 1997: 76-86 |
| 1996 |
|---|
| 6 | | Marie-Pierre Béal,
Olivier Carton,
Christophe Reutenauer:
Cyclic Languages and Strongly Cyclic Languages.
STACS 1996: 49-59 |
| 5 | | Marie-Pierre Béal,
Filippo Mignosi,
Antonio Restivo:
Minimal Forbidden Words and Symbolic Dynamics.
STACS 1996: 555-566 |
| 1995 |
|---|
| 4 | | Marie-Pierre Béal:
Puissance extérieure d'un automate déterministe, application au calcul de la fonction zêta d'un système sofique.
ITA 29(2): 85-103 (1995) |
| 1994 |
|---|
| 3 | | Jonathan J. Ashley,
Marie-Pierre Béal:
A note on the method of poles for code construction.
IEEE Transactions on Information Theory 40(2): 512- (1994) |
| 1990 |
|---|
| 2 | | Marie-Pierre Béal:
The method of poles: A coding method for constrained channels.
IEEE Transactions on Information Theory 36(4): 763-772 (1990) |
| 1988 |
|---|
| 1 | | Marie-Pierre Béal:
Codes Circulaires, Automates Locaux et Entropie.
Theor. Comput. Sci. 57: 283-302 (1988) |
