10 citations · 20 across the 5 of their papers we have counts for
5 papers
Transfinite Lyndon words
Olivier Carton, Luc Boasson
In this paper, we extend the notion of Lyndon word to transfinite words. We prove two main results. We first show that, given a transfinite word, there exists a unique factorizatio…
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…
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…
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.
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…