Jean Berstel

From MaRDI portal



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
A rewriting of Fife's theorem about overlap-free words
Lecture Notes in Computer Science
2024-01-29Paper
Properties of infinite words: recent results
STACS 89
2022-08-16Paper
Minimisation of automata
(available as arXiv preprint)
2022-02-04Paper
Symbolic dynamics
(available as arXiv preprint)
2021-11-12Paper
Hopcroft's automaton minimization algorithm and Sturmian words2017-02-10Paper
Bifix codes and Sturmian words
Journal of Algebra
2013-04-17Paper
Recent results on syntactic groups of prefix codes.
European Journal of Combinatorics
2012-08-14Paper
Splicing systems and the Chomsky hierarchy
Theoretical Computer Science
2012-06-25Paper
Variable length codes and finite automata2011-01-03Paper
Noncommutative rational series with applications2010-11-11Paper
The expressive power of the shuffle product
Information and Computation
2010-10-22Paper
On the groups of codes with empty kernel.
Semigroup Forum
2010-07-06Paper
Symbolic dynamics
(available as arXiv preprint)
2010-06-07Paper
Sturmian trees
Theory of Computing Systems
2010-05-05Paper
Operations preserving recognizable languages.
Lecture Notes in Computer Science
2010-04-20Paper
Codes and automata.2009-12-21Paper
scientific article; zbMATH DE number 5604082 (Why is no real title available?)2009-09-15Paper
Continuant polynomials and worst-case behavior of Hopcroft's minimization algorithm
Theoretical Computer Science
2009-08-07Paper
Combinatorics on Words2008-12-29Paper
Sturmian and Episturmian Words
Algebraic Informatics
2008-09-04Paper
Extension of Brzozowski's derivation calculus of rational expressions to series over the free partially commutative monoids
Theoretical Computer Science
2008-06-24Paper
Another proof of Soittola's theorem
Theoretical Computer Science
2008-04-15Paper
Crochemore Factorization of Sturmian and Other Infinite Words
Lecture Notes in Computer Science
2007-09-05Paper
A First Investigation of Sturmian Trees
STACS 2007
2007-09-03Paper
The origins of combinatorics on words
European Journal of Combinatorics
2007-03-27Paper
scientific article; zbMATH DE number 5051583 (Why is no real title available?)2006-09-06Paper
Operations preserving regular languages
Theoretical Computer Science
2006-04-28Paper
Implementation and Application of Automata
Lecture Notes in Computer Science
2005-08-17Paper
Growth of repetition-free words -- a review
Theoretical Computer Science
2005-08-01Paper
scientific article; zbMATH DE number 2155195 (Why is no real title available?)2005-04-11Paper
Mixed languages
Theoretical Computer Science
2005-04-06Paper
scientific article; zbMATH DE number 2087485 (Why is no real title available?)2004-08-11Paper
scientific article; zbMATH DE number 1993582 (Why is no real title available?)2003-10-21Paper
scientific article; zbMATH DE number 1988973 (Why is no real title available?)2003-10-20Paper
Formal properties of XML grammars and languages
Acta Informatica
2003-09-01Paper
RECENT RESULTS ON EXTENSIONS OF STURMIAN WORDS
International Journal of Algebra and Computation
2002-12-15Paper
An Exercise on Fibonacci Representations
RAIRO - Theoretical Informatics and Applications
2002-09-18Paper
An Exercise on Fibonacci Representations
RAIRO - Theoretical Informatics and Applications
2002-09-18Paper
Coding rotations on intervals
Theoretical Computer Science
2002-07-15Paper
Shuffle factorization is unique
Theoretical Computer Science
2002-07-15Paper
scientific article; zbMATH DE number 1759405 (Why is no real title available?)2002-06-25Paper
scientific article; zbMATH DE number 1408353 (Why is no real title available?)2002-04-08Paper
Circular codes
Séminaire Lotharingien de Combinatoire
2001-11-06Paper
A NOTE ON LIST LANGUAGES
International Journal of Algebra and Computation
2000-11-07Paper
scientific article; zbMATH DE number 1333603 (Why is no real title available?)1999-09-19Paper
Partial words and a theorem of Fine and Wilf
Theoretical Computer Science
1999-06-21Paper
The set of minimal words of a context-free language is context-free
Journal of Computer and System Sciences
1998-08-04Paper
Sturmian words, Lyndon words and trees
Theoretical Computer Science
1998-07-22Paper
scientific article; zbMATH DE number 1142312 (Why is no real title available?)1998-05-14Paper
A remark on morphic sturmian words
RAIRO - Theoretical Informatics and Applications
1998-03-16Paper
scientific article; zbMATH DE number 1091111 (Why is no real title available?)1997-11-25Paper
Local languages and the Berry-Sethi algorithm
Theoretical Computer Science
1997-02-27Paper
Random generation of finite Sturmian words
Discrete Mathematics
1996-09-03Paper
A relative of the Thue-Morse sequence
Discrete Mathematics
1996-06-19Paper
scientific article; zbMATH DE number 871238 (Why is no real title available?)1996-04-28Paper
Efficient computation of addition chains
Journal de Théorie des Nombres de Bordeaux
1995-05-15Paper
Efficient computation of addition chains
Journal de Théorie des Nombres de Bordeaux
1995-05-15Paper
Efficient computation of addition chains
Journal de Théorie des Nombres de Bordeaux
1995-05-15Paper
Efficient computation of addition chains
Journal de Théorie des Nombres de Bordeaux
1995-05-15Paper
Average cost of Duval's algorithm for generating Lyndon words
Theoretical Computer Science
1994-09-25Paper
Sturmian morphisms
Bulletin of the Belgian Mathematical Society - Simon Stevin
1994-06-15Paper
A GEOMETRIC PROOF OF THE ENUMERATION FORMULA FOR STURMIAN WORDS
International Journal of Algebra and Computation
1994-03-23Paper
A characterization of overlap-free morphisms
Discrete Applied Mathematics
1993-12-10Paper
scientific article; zbMATH DE number 41838 (Why is no real title available?)1992-09-17Paper
Zeta Functions of Formal Languages1992-06-25Paper
Thue-Morse sequence and p-adic topology for the free monoid
Discrete Mathematics
1989-01-01Paper
Addition chains using continued fractions
Journal of Algorithms
1989-01-01Paper
scientific article; zbMATH DE number 4096799 (Why is no real title available?)1988-01-01Paper
On the length of word chains
Information Processing Letters
1987-01-01Paper
Every iterated morphism yields a co-CFL
Information Processing Letters
1986-01-01Paper
scientific article; zbMATH DE number 3947643 (Why is no real title available?)1986-01-01Paper
scientific article; zbMATH DE number 4003555 (Why is no real title available?)1986-01-01Paper
scientific article; zbMATH DE number 3943051 (Why is no real title available?)1985-01-01Paper
scientific article; zbMATH DE number 3977002 (Why is no real title available?)1985-01-01Paper
scientific article; zbMATH DE number 3862473 (Why is no real title available?)1984-01-01Paper
scientific article; zbMATH DE number 3915644 (Why is no real title available?)1984-01-01Paper
scientific article; zbMATH DE number 3932412 (Why is no real title available?)1984-01-01Paper
scientific article; zbMATH DE number 3898259 (Why is no real title available?)1983-01-01Paper
Recognizable formal power series on trees
Theoretical Computer Science
1982-01-01Paper
scientific article; zbMATH DE number 3761430 (Why is no real title available?)1981-01-01Paper
More about the “geography” of context-free languages
Information and Control
1981-01-01Paper
Mots sans carre et morphismes iterés
Discrete Mathematics
1980-01-01Paper
scientific article; zbMATH DE number 3827237 (Why is no real title available?)1980-01-01Paper
Sur le théorème du defaut
Journal of Algebra
1979-01-01Paper
scientific article; zbMATH DE number 3660804 (Why is no real title available?)1979-01-01Paper
scientific article; zbMATH DE number 3661611 (Why is no real title available?)1979-01-01Paper
scientific article; zbMATH DE number 3668011 (Why is no real title available?)1979-01-01Paper
scientific article; zbMATH DE number 3610762 (Why is no real title available?)1978-01-01Paper
scientific article; zbMATH DE number 3621946 (Why is no real title available?)1978-01-01Paper
scientific article; zbMATH DE number 3626629 (Why is no real title available?)1978-01-01Paper
scientific article; zbMATH DE number 3569844 (Why is no real title available?)1977-01-01Paper
scientific article; zbMATH DE number 3581581 (Why is no real title available?)1977-01-01Paper
scientific article; zbMATH DE number 3581581 (Why is no real title available?)1977-01-01Paper
Deux propriétés décidables des suites récurrentes linéaires
Bulletin de la Société mathématique de France
1976-01-01Paper
Deux propriétés décidables des suites récurrentes linéaires
Bulletin de la Société mathématique de France
1976-01-01Paper
Factorisation de fractions rationnelles et de suites récurrentes
Acta Arithmetica
1976-01-01Paper
scientific article; zbMATH DE number 3549018 (Why is no real title available?)1975-01-01Paper
Sur une conjecture de S. Greibach
Acta Informatica
1974-01-01Paper
scientific article; zbMATH DE number 3453124 (Why is no real title available?)1974-01-01Paper
Une hiérarchie des parties rationnelles de N2
Mathematical Systems Theory
1973-01-01Paper
scientific article; zbMATH DE number 3415406 (Why is no real title available?)1973-01-01Paper
scientific article; zbMATH DE number 3414421 (Why is no real title available?)1971-01-01Paper
scientific article; zbMATH DE number 3297274 (Why is no real title available?)1970-01-01Paper
scientific article; zbMATH DE number 3343773 (Why is no real title available?)1970-01-01Paper
scientific article; zbMATH DE number 3343773 (Why is no real title available?)1970-01-01Paper
scientific article; zbMATH DE number 3420277 (Why is no real title available?)1970-01-01Paper
scientific article; zbMATH DE number 3277644 (Why is no real title available?)1968-01-01Paper
← Previous 100   1   2   Next 100 →


Research outcomes over time


This page was built for person: Jean Berstel