| Continuous Rational Functions Are Deterministic Regular | 0 | 0.34 | 2022 |
| Transfinite Lyndon words. | 0 | 0.34 | 2020 |
| Continuity of Functional Transducers: A Profinite Study of Rational Functions | 0 | 0.34 | 2020 |
| Preservation of Normality by Non-Oblivious Group Selection | 0 | 0.34 | 2019 |
| Polishness of some topologies related to word or tree automata. | 0 | 0.34 | 2019 |
| Normal numbers and nested perfect necklaces | 0 | 0.34 | 2019 |
| Preservation of normality by transducers | 0 | 0.34 | 2019 |
| A survey on difference hierarchies of regular languages. | 0 | 0.34 | 2018 |
| On normality in shifts of finite type. | 0 | 0.34 | 2018 |
| Continuity and Rational Functions. | 0 | 0.34 | 2018 |
| Finite-state independence. | 0 | 0.34 | 2018 |
| An Algebraic Approach to MSO-Definability on Countable linear Orderings. | 1 | 0.36 | 2018 |
| Normal numbers with digit dependencies. | 0 | 0.34 | 2018 |
| Simon's Theorem for Scattered Words. | 0 | 0.34 | 2018 |
| Polishness of some topologies related to automata (Extended version). | 0 | 0.34 | 2017 |
| Polishness of Some Topologies Related to Automata. | 0 | 0.34 | 2017 |
| Finite-state Independence and Normal Sequences. | 0 | 0.34 | 2017 |
| Normality and automata | 4 | 0.56 | 2015 |
| Aperiodic Two-way Transducers and FO-Transductions. | 8 | 0.52 | 2015 |
| Normality and two-way automata | 3 | 0.52 | 2015 |
| Rational Selecting Relations and Selectors. | 0 | 0.34 | 2015 |
| Channel Synthesis Revisited. | 0 | 0.34 | 2014 |
| An aperiodicity problem for multiwords. | 0 | 0.34 | 2012 |
| Two-way transducers with a two-way output tape | 2 | 0.40 | 2012 |
| Algebraic Characterization of FO for Scattered Linear Orderings. | 1 | 0.39 | 2011 |
| Regular languages of words over countable linear orderings | 8 | 0.81 | 2011 |
| Logic and Rational Languages of Words Indexed by Linear Orderings | 11 | 1.04 | 2010 |
| The expressive power of the shuffle product | 8 | 0.57 | 2010 |
| Sturmian Trees | 5 | 0.50 | 2010 |
| Right-Sequential functions on infinite words | 1 | 0.36 | 2010 |
| Minimization of Automata | 6 | 0.45 | 2010 |
| Infinite words without palindrome | 4 | 0.48 | 2009 |
| Continuant polynomials and worst-case behavior of Hopcroft's minimization algorithm | 14 | 0.78 | 2009 |
| Languages recognized by finite supersoluble groups | 0 | 0.34 | 2009 |
| Left and Right Synchronous Relations | 0 | 0.34 | 2009 |
| Tree Automata and Automata on Linear Orderings | 4 | 0.56 | 2009 |
| Automata and semigroups recognizing infinite words | 4 | 0.47 | 2008 |
| On the Continuity Set of an omega Rational Function | 2 | 0.41 | 2008 |
| A first investigation of Sturmian trees | 4 | 0.49 | 2007 |
| Automata on linear orderings | 33 | 2.36 | 2007 |
| The growth ratio of synchronous rational relations is unique | 4 | 0.43 | 2007 |
| Complementation of rational sets on scattered linear orderings of finite rank | 1 | 0.36 | 2007 |
| Decision problems among the main subfamilies of rational relations | 12 | 0.58 | 2006 |
| Operations preserving regular languages | 4 | 0.56 | 2006 |
| A Kleene Theorem for Languages of Words Indexed by Linear Orderings | 9 | 0.68 | 2006 |
| Hierarchy Among Automata on Linear Orderings | 8 | 0.82 | 2005 |
| Determinization of Transducers over Infinite Words: The General Case | 3 | 0.50 | 2004 |
| On the complexity of hopcroft’s state minimization algorithm | 24 | 1.23 | 2004 |
| Unambiguous Automata on Bi-infinite Words | 1 | 0.39 | 2003 |
| Operations Preserving Recognizable Languages | 7 | 0.64 | 2003 |
