The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Jean Berstel: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Jean Berstel
    A Rewriting of Fife's Theorem about Overlap-Free Words. [Citation Graph (0, 0)][DBLP]
    Results and Trends in Theoretical Computer Science, 1994, pp:19-29 [Conf]
  2. Jean Berstel
    On the Index of Sturmian Words. [Citation Graph (0, 0)][DBLP]
    Jewels are Forever, 1999, pp:287-294 [Conf]
  3. Jean Berstel, Luc Boasson
    Balanced Grammars and Their Languages. [Citation Graph (0, 0)][DBLP]
    Formal and Natural Computing, 2002, pp:3-25 [Conf]
  4. Jean Berstel
    Recent Results on Sturmian Words. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 1995, pp:13-24 [Conf]
  5. Jean Berstel
    Some Recent Results on Recognizable Formal Power Series. [Citation Graph (0, 0)][DBLP]
    FCT, 1977, pp:39-48 [Conf]
  6. Jean Berstel, Luc Boasson, Olivier Carton, Bruno Petazzoni, Jean-Eric Pin
    Operations Preserving Recognizable Languages. [Citation Graph (0, 0)][DBLP]
    FCT, 2003, pp:343-354 [Conf]
  7. Jean Berstel
    On Sets of Numbers Recognized by Push-Down Automata [Citation Graph (0, 0)][DBLP]
    FOCS, 1972, pp:200-206 [Conf]
  8. Jean Berstel
    Sur la densité asymptotique de langages formels. [Citation Graph (0, 0)][DBLP]
    ICALP, 1972, pp:345-358 [Conf]
  9. Jean Berstel
    Sur les mots sans carré définis par un morphisme. [Citation Graph (0, 0)][DBLP]
    ICALP, 1979, pp:16-25 [Conf]
  10. Jean Berstel, Luc Boasson
    Une suite decroissante de cônes rationnels. [Citation Graph (0, 0)][DBLP]
    ICALP, 1974, pp:383-397 [Conf]
  11. Jean Berstel, Christophe Reutenauer
    Zeta Functions of Recognizable Languages. [Citation Graph (0, 0)][DBLP]
    ICALP, 1988, pp:93-104 [Conf]
  12. Jean Berstel, Stefano Crespi-Reghizzi, Gilles Roussel, Pierluigi San Pietro
    A Scalable Formal Method for Design and Automatic Checking of User Interfaces. [Citation Graph (0, 0)][DBLP]
    ICSE, 2001, pp:453-462 [Conf]
  13. Jean Berstel
    Finite automata and rational languages. An introduction. [Citation Graph (0, 0)][DBLP]
    Formal Properties of Finite Automata and Applications, 1988, pp:2-14 [Conf]
  14. Joffroy Beauquier, Jean Berstel
    More about the ``Geography'' of Context-Free Languages. [Citation Graph (0, 0)][DBLP]
    MFCS, 1981, pp:183-192 [Conf]
  15. Jean Berstel, Luc Boasson
    XML Grammars. [Citation Graph (0, 0)][DBLP]
    MFCS, 2000, pp:182-191 [Conf]
  16. Jean Berstel, Alessandra Savelli
    Crochemore Factorization of Sturmian and Other Infinite Words. [Citation Graph (0, 0)][DBLP]
    MFCS, 2006, pp:157-166 [Conf]
  17. Jean Berstel, Jacques Sakarovitch
    Recent Results in the Theory of Rational Sets. [Citation Graph (0, 0)][DBLP]
    MFCS, 1986, pp:15-28 [Conf]
  18. Jean Berstel, Patrice Séébold
    A Characterization of Sturmian Morphisms. [Citation Graph (0, 0)][DBLP]
    MFCS, 1993, pp:281-290 [Conf]
  19. Jean Berstel
    Some Recent Results on Squarefree Words. [Citation Graph (0, 0)][DBLP]
    STACS, 1984, pp:14-25 [Conf]
  20. Jean Berstel
    Properties of Infinite Words: Recent Result. [Citation Graph (0, 0)][DBLP]
    STACS, 1989, pp:36-46 [Conf]
  21. Jean Berstel, Luc Boasson, Olivier Carton, Isabelle Fagnot
    A First Investigation of Sturmian Trees. [Citation Graph (0, 0)][DBLP]
    STACS, 2007, pp:73-84 [Conf]
  22. Jean Berstel, Olivier Carton
    On the Complexity of Hopcroft's State Minimization Algorithm. [Citation Graph (0, 0)][DBLP]
    CIAA, 2004, pp:35-44 [Conf]
  23. Jean Berstel
    Sur une Conjecture de S. Greibach [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1974, v:3, n:, pp:293-295 [Journal]
  24. Jean Berstel, Luc Boasson
    Formal properties of XML grammars and languages. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 2002, v:38, n:9, pp:649-671 [Journal]
  25. Jean Berstel, Luc Boasson
    Formal Properties of XML Grammars and Languages [Citation Graph (0, 0)][DBLP]
    CoRR, 2000, v:0, n:, pp:- [Journal]
  26. Jean Berstel, Patrice Séébold
    A Characterization of Overlap-Free Morphisms. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1993, v:46, n:3, pp:275-281 [Journal]
  27. Jean Berstel
    Langford strings are square free. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 1989, v:37, n:, pp:127-128 [Journal]
  28. Jean Berstel, Luc Boasson
    The set of Lyndon words is not context-free. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 1997, v:63, n:, pp:- [Journal]
  29. Jean Berstel, Juhani Karhumäki
    Combinatorics on words: a tutorial. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 2003, v:79, n:, pp:178-0 [Journal]
  30. Jean Berstel, Dominique Perrin
    The origins of combinatorics on words. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2007, v:28, n:3, pp:996-1022 [Journal]
  31. Jean Berstel, Luc Boasson
    Towards an Algebraic Theory of Context-Free Languages. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 1996, v:25, n:3, pp:217-239 [Journal]
  32. Joffroy Beauquier, Jean Berstel
    More about the ``Geography'' of Context-Free Languages [Citation Graph (0, 0)][DBLP]
    Information and Control, 1981, v:49, n:2, pp:91-108 [Journal]
  33. Jean Berstel
    Recent Results on Extensions of Sturmian Words. [Citation Graph (0, 0)][DBLP]
    IJAC, 2002, v:12, n:1-2, pp:371-385 [Journal]
  34. Jean Berstel
    Every Iterated Morphism Yields a co-CFL. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1986, v:22, n:1, pp:7-9 [Journal]
  35. Jean Berstel, Srecko Brlek
    On the Length of Word Chains. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1987, v:26, n:1, pp:23-28 [Journal]
  36. Jean Berstel
    An Exercise on Fibonacci Representations. [Citation Graph (0, 0)][DBLP]
    ITA, 2001, v:35, n:6, pp:491-498 [Journal]
  37. Jean Berstel, Patrice Séébold
    A Remark on Morphic Sturmian Words. [Citation Graph (0, 0)][DBLP]
    ITA, 1994, v:28, n:3-4, pp:255-263 [Journal]
  38. François Bergeron, Jean Berstel, Srecko Brlek, Christine Duboc
    Addition Chains Using Continued Fractions. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1989, v:10, n:3, pp:403-412 [Journal]
  39. Jean Berstel, Luc Boasson
    The Set of Minimal Words of a Context-Free Language is Context-Free. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1997, v:55, n:3, pp:477-488 [Journal]
  40. Jean Berstel
    Une Hiérarchie des Parties Rationelles de N². [Citation Graph (0, 0)][DBLP]
    Mathematical Systems Theory, 1973, v:7, n:2, pp:114-137 [Journal]
  41. Jean Berstel
    Growth of repetition-free words -- a review. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:340, n:1, pp:280-290 [Journal]
  42. Jean Berstel, Luc Boasson
    Shuffle factorization is unique. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:273, n:1-2, pp:47-67 [Journal]
  43. Jean Berstel, Luc Boasson
    Partial Words and a Theorem of Fine and Wilf. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1999, v:218, n:1, pp:135-141 [Journal]
  44. Jean Berstel, Luc Boasson, Olivier Carton, Bruno Petazzoni, Jean-Eric Pin
    Operations preserving regular languages. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:354, n:3, pp:405-420 [Journal]
  45. Jean Berstel, Luc Boasson, Michel Latteux
    Mixed languages. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:332, n:1-3, pp:179-198 [Journal]
  46. Jean Berstel, Aldo de Luca
    Sturmian Words, Lyndon Words and Trees. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1997, v:178, n:1-2, pp:171-203 [Journal]
  47. Jean Berstel, Michel Pocchiola
    Average Cost of Duval's Algorithm for Generating Lyndon Words. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1994, v:132, n:2, pp:415-425 [Journal]
  48. Jean Berstel, Jean-Eric Pin
    Local Languages and the Berry-Sethi Algorithm. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1996, v:155, n:2, pp:439-446 [Journal]
  49. Jean Berstel, Christophe Reutenauer
    Recognizable Formal Power Series on Trees. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1982, v:18, n:, pp:115-148 [Journal]
  50. Jean Berstel, Laurent Vuillon
    Coding rotations on intervals. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:281, n:1-2, pp:99-107 [Journal]
  51. Jean Berstel, Stefano Crespi-Reghizzi, Gilles Roussel, Pierluigi San Pietro
    A scalable formal method for design and automatic checking of user interfaces. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Softw. Eng. Methodol., 2005, v:14, n:2, pp:124-167 [Journal]
  52. Jean Berstel, Maxime Crochemore, Jean-Eric Pin
    Thue-Morse sequence and p-adic topology for the free monoid. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1989, v:76, n:2, pp:89-94 [Journal]
  53. Jean Berstel, Michel Pocchiola
    Random generation of finite Sturmian words. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:153, n:1-3, pp:29-39 [Journal]
  54. Jean-Paul Allouche, André Arnold, Jean Berstel, Srecko Brlek, William Jockusch, Simon Plouffe, Bruce E. Sagan
    A relative of the Thue-Morse sequence. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1995, v:139, n:1-3, pp:455-461 [Journal]

  55. Séries formelles reconnaissables d'arbres et applications. [Citation Graph (, )][DBLP]


  56. Sturmian and Episturmian Words. [Citation Graph (, )][DBLP]


  57. Infinite words without palindrome [Citation Graph (, )][DBLP]


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


Search in 0.003secs, Finished in 0.453secs
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
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002