10 citations · 18 across the 2 of their papers we have counts for
2 papers
cs.FL2010★ 8 cited
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…
cs.DM2009★ 10 cited
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.