default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
Exact matches
- Jean Berstel
University Paris-Est Marne-la-Vallée, France
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 85 matches
- 2021
- Marie-Pierre Béal, Jean Berstel, Søren Eilers, Dominique Perrin:
Symbolic dynamics. Handbook of Automata Theory (II.) 2021: 987-1030 - Jean Berstel, Luc Boasson, Olivier Carton, Isabelle Fagnot:
Minimisation of automata. Handbook of Automata Theory (I.) 2021: 337-373 - 2013
- Jean Berstel:
Lettre à Christophe Reutenauer. Int. J. Algebra Comput. 23(4) (2013) - 2012
- Jean Berstel, Clelia de Felice, Dominique Perrin, Christophe Reutenauer, Giuseppina Rindone:
Recent results on syntactic groups of prefix codes. Eur. J. Comb. 33(7): 1386-1401 (2012) - Jean Berstel, Luc Boasson, Isabelle Fagnot:
Splicing systems and the Chomsky hierarchy. Theor. Comput. Sci. 436: 2-22 (2012) - 2011
- Jean Berstel, Luc Boasson, Isabelle Fagnot:
Splicing systems and the Chomsky hierarchy. CoRR abs/1102.0947 (2011) - 2010
- Jean Berstel, Dominique Perrin, Christophe Reutenauer:
Codes and Automata. Encyclopedia of mathematics and its applications 129, Cambridge University Press 2010, ISBN 978-0-521-88831-8, pp. I-XIII, 1-619 - Jean Berstel, Luc Boasson, Olivier Carton, Jean-Eric Pin, Antonio Restivo:
The expressive power of the shuffle product. Inf. Comput. 208(11): 1258-1272 (2010) - Jean Berstel, Luc Boasson, Olivier Carton, Isabelle Fagnot:
Sturmian Trees. Theory Comput. Syst. 46(3): 443-478 (2010) - Marie-Pierre Béal, Jean Berstel, Søren Eilers, Dominique Perrin:
Symbolic dynamics. CoRR abs/1006.1265 (2010) - Jean Berstel, Luc Boasson, Olivier Carton, Isabelle Fagnot:
Minimization of Automata. CoRR abs/1010.5318 (2010) - Jean Berstel, Clelia de Felice, Dominique Perrin, Christophe Reutenauer, Giuseppina Rindone:
Bifix codes and Sturmian words. CoRR abs/1011.5369 (2010) - 2009
- Jean Berstel, Luc Boasson, Olivier Carton:
Continuant polynomials and worst-case behavior of Hopcroft's minimization algorithm. Theor. Comput. Sci. 410(30-32): 2811-2822 (2009) - Jean Berstel, Luc Boasson, Olivier Carton, Isabelle Fagnot:
Infinite words without palindrome. CoRR abs/0903.2382 (2009) - 2008
- Jean Berstel, Tero Harju, Juhani Karhumäki:
Preface. RAIRO Theor. Informatics Appl. 42(4): 657 (2008) - Jean Berstel, Christophe Reutenauer:
Another proof of Soittola's theorem. Theor. Comput. Sci. 393(1-3): 196-203 (2008) - Jean Berstel, Christophe Reutenauer:
Extension of Brzozowski's derivation calculus of rational expressions to series over the free partially commutative monoids. Theor. Comput. Sci. 400(1-3): 144-158 (2008) - 2007
- Jean Berstel, Dominique Perrin:
The origins of combinatorics on words. Eur. J. Comb. 28(3): 996-1022 (2007) - Jean Berstel:
Sturmian and Episturmian Words. CAI 2007: 23-47 - Jean Berstel, Luc Boasson, Olivier Carton, Isabelle Fagnot:
A First Investigation of Sturmian Trees. STACS 2007: 73-84 - 2006
- Jean Berstel, Luc Boasson, Olivier Carton, Bruno Petazzoni, Jean-Eric Pin:
Operations preserving regular languages. Theor. Comput. Sci. 354(3): 405-420 (2006) - Jean Berstel, Alessandra Savelli:
Crochemore Factorization of Sturmian and Other Infinite Words. MFCS 2006: 157-166 - 2005
- Jean Berstel:
Growth of repetition-free words -- a review. Theor. Comput. Sci. 340(1): 280-290 (2005) - Jean Berstel, Luc Boasson, Michel Latteux:
Mixed languages. Theor. Comput. Sci. 332(1-3): 179-198 (2005) - Jean Berstel, Stefano Crespi-Reghizzi, Gilles Roussel, Pierluigi San Pietro:
A scalable formal method for design and automatic checking of user interfaces. ACM Trans. Softw. Eng. Methodol. 14(2): 124-167 (2005) - 2004
- Jean Berstel:
Review of "Automatic sequences: theory, applications, generalizations" by Jean-Paul Allouche and Jeffrey Shallit. Cambridge University Press. SIGACT News 35(1): 12-16 (2004) - Jean Berstel, Olivier Carton:
On the Complexity of Hopcroft's State Minimization Algorithm. CIAA 2004: 35-44 - 2003
- Jean Berstel, Juhani Karhumäki:
Combinatorics on words: a tutorial. Bull. EATCS 79: 178- (2003) - Srecko Brlek, Christophe Reutenauer:
On a valuation of rational subsets of Zk Dédié à Jean Berstel. Theor. Comput. Sci. 292(1): 85-96 (2003) - Publications of Jean Berstel. Theor. Comput. Sci. 292(1): 3-7 (2003)
skipping 55 more matches
loading more results
failed to load more results, please try again later
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
retrieved on 2024-10-07 14:20 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint