1.6k citations
- Université Gustave EiffelFR143 papers
- Centre National de la Recherche ScientifiqueFR64 papers
- Institutt for Grafiske MedierNO25 papers
- Université Paris CitéFR13 papers
- École nationale des ponts et chausséesFR10 papers
- Institut de Recherche en Informatique FondamentaleFR9 papers
- IFP Énergies nouvellesFR8 papers
- UniLaSalle Amiens (ESIEE-Amiens)FR8 papers
- Université Paris-SaclayFR8 papers
- Hankuk University of Foreign StudiesKR6 papers
- Laboratoire d'Informatique, du Traitement de l'Information et des SystèmesFR6 papers
- Paris-Est SupFR6 papers
5 papers · 1 filter
Weakly-unambiguous Parikh automata and their link to holonomic series
Alin Bostan, Arnaud Carayol, Florent Koechlin +1
We investigate the connection between properties of formal languages and properties of their generating series, with a focus on the class of holonomic power series. We first prove…
Density of rational languages under shift invariant measures
Valérie Berthé, Herman Goulet-Ouellet, Dominique Perrin
We study density of rational languages under shift invariant probability measures on spaces of two-sided infinite words, which generalizes the classical notion of density studied i…
Enumerating regular languages in radix order : Revisiting the Ackerman-Shallit algorithm
Nadime Francis, Victor Marsault
We consider the problem of enumerating a regular language in radix order, or more precisely, the equivalent problem of enumerating all words in of a given length in lexicog…
Splicing systems and the Chomsky hierarchy
Jean Berstel, Luc Boasson, Isabelle Fagnot
In this paper, we prove decidability properties and new results on the position of the family of languages generated by (circular) splicing systems within the Chomsky hierarchy. Th…
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…