The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Marie-Pierre Béal: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  37. Sofic and Almost of Finite Type Tree-Shifts. [Citation Graph (, )][DBLP]


  38. A Quadratic Upper Bound on the Size of a Synchronizing Word in One-Cluster Automata. [Citation Graph (, )][DBLP]


  39. Decidability of Conjugacy of Tree-Shifts of Finite Type. [Citation Graph (, )][DBLP]


  40. A quadratic algorithm for road coloring [Citation Graph (, )][DBLP]


  41. Symbolic dynamics [Citation Graph (, )][DBLP]


Search in 0.095secs, Finished in 0.096secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002