Jean Berstel

From MaRDI portal
Person:213070

Available identifiers

zbMath Open berstel.jeanDBLPb/JeanBerstelWikidataQ29024889 ScholiaQ29024889MaRDI QIDQ213070

List of research outcomes





PublicationDate of PublicationType
A rewriting of Fife's theorem about overlap-free words2024-01-29Paper
Properties of infinite words: recent results2022-08-16Paper
Minimisation of automata2022-02-04Paper
Symbolic dynamics2021-11-12Paper
Hopcroft's automaton minimization algorithm and Sturmian words2017-02-10Paper
Bifix codes and Sturmian words2013-04-17Paper
Recent results on syntactic groups of prefix codes.2012-08-14Paper
Splicing systems and the Chomsky hierarchy2012-06-25Paper
Variable length codes and finite automata2011-01-03Paper
Noncommutative rational series with applications2010-11-11Paper
The expressive power of the shuffle product2010-10-22Paper
On the groups of codes with empty kernel.2010-07-06Paper
Symbolic dynamics2010-06-07Paper
Sturmian trees2010-05-05Paper
Operations preserving recognizable languages.2010-04-20Paper
Codes and automata.2009-12-21Paper
https://portal.mardi4nfdi.de/entity/Q33959632009-09-15Paper
Continuant polynomials and worst-case behavior of Hopcroft's minimization algorithm2009-08-07Paper
Combinatorics on Words2008-12-29Paper
Sturmian and Episturmian Words2008-09-04Paper
Extension of Brzozowski's derivation calculus of rational expressions to series over the free partially commutative monoids2008-06-24Paper
Another proof of Soittola's theorem2008-04-15Paper
Crochemore Factorization of Sturmian and Other Infinite Words2007-09-05Paper
A First Investigation of Sturmian Trees2007-09-03Paper
The origins of combinatorics on words2007-03-27Paper
https://portal.mardi4nfdi.de/entity/Q54860102006-09-06Paper
Operations preserving regular languages2006-04-28Paper
Implementation and Application of Automata2005-08-17Paper
Growth of repetition-free words -- a review2005-08-01Paper
https://portal.mardi4nfdi.de/entity/Q46657422005-04-11Paper
Mixed languages2005-04-06Paper
https://portal.mardi4nfdi.de/entity/Q47382852004-08-11Paper
https://portal.mardi4nfdi.de/entity/Q44312242003-10-21Paper
https://portal.mardi4nfdi.de/entity/Q44303002003-10-20Paper
Formal properties of XML grammars and languages2003-09-01Paper
RECENT RESULTS ON EXTENSIONS OF STURMIAN WORDS2002-12-15Paper
An Exercise on Fibonacci Representations2002-09-18Paper
Shuffle factorization is unique2002-07-15Paper
Coding rotations on intervals2002-07-15Paper
https://portal.mardi4nfdi.de/entity/Q45363542002-06-25Paper
https://portal.mardi4nfdi.de/entity/Q49411682002-04-08Paper
Circular codes2001-11-06Paper
A NOTE ON LIST LANGUAGES2000-11-07Paper
https://portal.mardi4nfdi.de/entity/Q42603761999-09-19Paper
Partial words and a theorem of Fine and Wilf1999-06-21Paper
The set of minimal words of a context-free language is context-free1998-08-04Paper
Sturmian words, Lyndon words and trees1998-07-22Paper
https://portal.mardi4nfdi.de/entity/Q43855281998-05-14Paper
A remark on morphic sturmian words1998-03-16Paper
https://portal.mardi4nfdi.de/entity/Q43668871997-11-25Paper
Local languages and the Berry-Sethi algorithm1997-02-27Paper
Random generation of finite Sturmian words1996-09-03Paper
A relative of the Thue-Morse sequence1996-06-19Paper
https://portal.mardi4nfdi.de/entity/Q48746521996-04-28Paper
Efficient computation of addition chains1995-05-15Paper
Average cost of Duval's algorithm for generating Lyndon words1994-09-25Paper
Sturmian morphisms1994-06-15Paper
A GEOMETRIC PROOF OF THE ENUMERATION FORMULA FOR STURMIAN WORDS1994-03-23Paper
A characterization of overlap-free morphisms1993-12-10Paper
https://portal.mardi4nfdi.de/entity/Q39947771992-09-17Paper
Zeta Functions of Formal Languages1992-06-25Paper
Thue-Morse sequence and p-adic topology for the free monoid1989-01-01Paper
Addition chains using continued fractions1989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38231561988-01-01Paper
On the length of word chains1987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37181711986-01-01Paper
Every iterated morphism yields a co-CFL1986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47282641986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37144791985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37433081985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36910741984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37049061984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33305421984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36771891983-01-01Paper
Recognizable formal power series on trees1982-01-01Paper
More about the “geography” of context-free languages1981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39440301981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36731371980-01-01Paper
Mots sans carre et morphismes iterés1980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38592671979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38600071979-01-01Paper
Sur le théorème du defaut1979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38655171979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41849891978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41747861978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41887731978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41403951977-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41511261977-01-01Paper
Deux propriétés décidables des suites récurrentes linéaires1976-01-01Paper
Factorisation de fractions rationnelles et de suites récurrentes1976-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41233521975-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47768551974-01-01Paper
Sur une conjecture de S. Greibach1974-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56797271973-01-01Paper
Une hiérarchie des parties rationnelles de N21973-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56789491971-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56198881970-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55803691970-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56837161970-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55620801968-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55269921967-01-01Paper

Research outcomes over time

This page was built for person: Jean Berstel