Browsing by Author "Lacroix, Anne"

Now showing items 1-2 of 2

    • Automaticity of Primitive Words and Irreducible Polynomials 

      Lacroix, Anne; Rampersad, Narad (Discrete Mathematics and Theoretical Computer Science, 2013)
      If L is a language, the automaticity function AL(n) (resp. NL(n)) of L counts the number of states of a smallest deterministic (resp. non-deterministic) finite automaton that accepts a language that agrees with L on all ...

    • Multi-dimensional sets recognizable in all abstract numeration systems 

      Charlier, Émilie; Lacroix, Anne; Rampersad, Narad (EDP Sciences, 2011)
      We prove that the subsets of Nd that are S-recognizable for all abstract numeration systems S are exactly the 1-recognizable sets. This generalizes a result of Lecomte and Rigo in the one-dimensional setting.