3 papers
cs.FL2014
(k,l)-Unambiguity and Quasi-Deterministic Structures
Pascal Caron, Marianne Flouret, Ludovic Mignot
We focus on the family of -unambiguous automata that encompasses the one of deterministic -lookahead automata introduced by Han and Wood. We show that this family present…
cs.FL2009
Algorithms for Glushkov K-graphs
Pascal Caron, Marianne Flouret
The automata arising from the well known conversion of regular expression to non deterministic automata have rather particular transition graphs. We refer to them as the Glushkov g…
math.CO2006
Direct and dual laws for automata with multiplicities
Gérard Duchamp, Marianne Flouret, Eric Laugerotte +1
We present here theoretical results coming from the implementation of the package called AMULT (automata with multiplicities in several noncommutative variables). We show that clas…