10 citations · 18 across the 5 of their papers we have counts for
6 papers
Bifix codes and Sturmian words
Jean Berstel, Clelia De Felice, Dominique Perrin +2
We prove new results concerning the relation between bifix codes, episturmian words and subgroups offree groups. We study bifix codes in factorial sets of words. We generalize most…
Minimization of Automata
Jean Berstel, Luc Boasson, Olivier Carton +1
This chapter is concerned with the design and analysis of algorithms for minimizing finite automata. Getting a minimal automaton is a fundamental issue in the use and implementatio…
Symbolic dynamics
Marie-Pierre Béal, Jean Berstel, Søren Eilers +1
This chapter presents some of the links between automata theory and symbolic dynamics. The emphasis is on two particular points. The first one is the interplay between some particu…
Infinite words without palindrome
Jean Berstel, Luc Boasson, Olivier Carton +1
We show that there exists an uniformly recurrent infinite word whose set of factors is closed under reversal and which has only finitely many palindromic factors.
Coding rotations on intervals
Jean Berstel, Laurent Vuillon
We show that the coding of rotation by on intervals with rationally independent lengths can be recoded over Sturmian words of angle More precisely, for a given …
Formal Properties of XML Grammars and Languages
Jean Berstel, Luc Boasson
XML documents are described by a document type definition (DTD). An XML-grammar is a formal grammar that captures the syntactic features of a DTD. We investigate properties of this…