Travelled to:1 × Finland
1 × Greece
1 × Italy
1 × Portugal
1 × Switzerland
1 × Taiwan
1 × United Kingdom
2 × Germany
Collaborated with:D.Perrin O.Carton S.Lombardy P.Heller N.Aubrun M.V.Berlinkov F.Burderi A.Restivo J.Sakarovitch F.Bassino J.Champarnaud J.Dubernard H.Jeanne
Talks about:automata (3) decid (3) word (3) one (3) conjugaci (2) synchron (2) regular (2) quadrat (2) cluster (2) upper (2)
Person: Marie-Pierre Béal
DBLP: B=eacute=al:Marie=Pierre
Facilitated 2 volumes:
EdEdContributed to:
2015201220092011
200920072005200019991997Wrote 10 papers:
- DLT-2015-BealH #finite
- Deciding Proper Conjugacy of Classes of One-Sided Finite-Type-Dyck Shifts (MPB, PH), pp. 167–178.
- DLT-2012-BealCDJL #decidability #geometry #regular expression
- Decidability of Geometricity of Regular Languages (MPB, JMC, JPD, HJ, SL), pp. 62–72.
- DLT-2009-BealP #automaton #bound #clustering #polynomial #word
- A Quadratic Upper Bound on the Size of a Synchronizing Word in One-Cluster Automata (MPB, DP), pp. 81–90.
- DLT-J-2009-BealBP11 #automaton #bound #clustering #polynomial #word
- A Quadratic Upper Bound on the Size of a Synchronizing Word in One-Cluster Automata (MPB, MVB, DP), pp. 277–288.
- ICALP-v1-2009-AubrunB #decidability #finite
- Decidability of Conjugacy of Tree-Shifts of Finite Type (NA, MPB), pp. 132–143.
- DLT-2007-BealBR #ambiguity
- Coding Partitions: Regularity, Maximality and Global Ambiguity (MPB, FB, AR), pp. 48–59.
- ICALP-2005-BealLS #equivalence #on the
- On the Equivalence of -Automata (MPB, SL, JS), pp. 397–409.
- ICALP-2000-BealC #infinity #transducer #word
- Determinization of Transducers over Infinite Words (MPB, OC), pp. 561–570.
- DLT-1999-BealC
- Asynchronous sliding block maps (MPB, OC), pp. 47–59.
- ICALP-1997-BassinoBP #sequence
- Enumerative Sequences of Leaves in Rational Trees (FB, MPB, DP), pp. 76–86.