10 citations · 20 across the 3 of their papers we have counts for
3 papers
cs.FL2015★ 2 cited
Splicing Systems from Past to Future: Old and New Challenges
Luc Boasson, Paola Bonizzoni, Clelia De Felice +4
A splicing system is a formal model of a recombinant behaviour of sets of double stranded DNA molecules when acted on by restriction enzymes and ligase. In this survey we will conc…
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.