| Languages and formations generated by and . | 0 | 0.34 | 2019 |
| Newton series, coinductively: a comparative study of composition. | 0 | 0.34 | 2019 |
| A survey on difference hierarchies of regular languages. | 0 | 0.34 | 2018 |
| Inequalities for One-Step Products. | 0 | 0.34 | 2018 |
| On uniformly continuous functions for some profinite topologies. | 0 | 0.34 | 2017 |
| The EATCS Award 2017 - Laudatio for Eva Tardos. | 0 | 0.34 | 2017 |
| Commutative Positive Varieties of Languages. | 0 | 0.34 | 2017 |
| The EATCS Award 2018 - Call for Nominations. | 0 | 0.34 | 2017 |
| Some Results of Zoltán Ésik on Regular Languages. | 0 | 0.34 | 2017 |
| Duality in Computer Science (Dagstuhl Seminar 13311). | 0 | 0.34 | 2015 |
| On Profinite Uniform Structures Defined By Varieties Of Finite Monoids | 6 | 1.11 | 2011 |
| 10501 Executive Summary - Advances and Applications of Automata on Words and Trees. | 0 | 0.34 | 2010 |
| A Topological Approach to Recognition | 7 | 0.64 | 2010 |
| Varieties Generated by Certain Models of Reversible Finite Automata | 3 | 0.40 | 2010 |
| 10501 Abstracts Collection - Advances and Applications of Automata on Words and Trees. | 0 | 0.34 | 2010 |
| Equations Defining the Polynomial Closure of a Lattice of Regular Languages | 6 | 0.54 | 2009 |
| Profinite Methods in Automata Theory | 19 | 1.58 | 2009 |
| Automata and semigroups recognizing infinite words | 4 | 0.47 | 2008 |
| A Mahler's theorem for functions from words to integers | 5 | 0.77 | 2008 |
| First Order Formulas with Modular Ppredicates | 12 | 0.56 | 2006 |
| Operations preserving regular languages | 4 | 0.56 | 2006 |
| A topological approach to transductions | 9 | 0.74 | 2005 |
| Expressive power of existential first-order sentences of Bu"chi's sequential calculus | 3 | 0.48 | 2005 |
| Some results on $\cal C$-varieties | 1 | 0.41 | 2005 |
| The Consequences of Imre Simon's Work in the Theory of Automata, Languages, and Semigroups | 0 | 0.34 | 2004 |
| Algebraic tools for the concatenation product | 10 | 0.86 | 2003 |
| Operations Preserving Recognizable Languages | 7 | 0.64 | 2003 |
| A conjecture on the concatenation product | 6 | 0.52 | 2001 |
| Words Guaranteeing Minimum Image | 2 | 0.67 | 2000 |
| Uniformities On Free Semigroups | 3 | 0.64 | 1999 |
| Bridges for Concatenation Hierarchies | 13 | 0.77 | 1998 |
| Positive Varieties and Infinite Words | 9 | 0.63 | 1998 |
| Polynomial Closure and Unambiguous Product | 65 | 2.62 | 1997 |
| The Expressive Power of Existential First Order Sentences of Büchi's Sequential Calculus | 5 | 0.68 | 1996 |
| Local languages and the Berry-Sethi algorithm | 24 | 2.94 | 1996 |
| Logic, Semigroups and Automata on Words | 30 | 1.47 | 1996 |
| Polynomial closure of group languages and open sets of the Hall topology | 19 | 1.42 | 1996 |
| A negative answer to a question of Wilke on varieties of &ohgr;-languages | 1 | 0.37 | 1995 |
| On the expressive power of temporal logic | 47 | 2.99 | 1993 |
| A Graphic Language Based on Timing Diagrams | 1 | 0.38 | 1993 |
| The Bideterministic Concatenation Product. | 2 | 0.41 | 1993 |
| On Reversible Automata | 30 | 2.58 | 1992 |
| Languages and scanners | 20 | 1.69 | 1991 |
| Ash's Type II Theorem, Profinite Topology and Malcev Products: Part I. | 29 | 3.62 | 1991 |
| A Purely Algebraic Proof of McNaughton's Theorem on Infinite Words | 1 | 0.35 | 1991 |
| Semigroups with Idempotent stabilizers and Applications to Automata Theory. | 5 | 0.72 | 1991 |
| Factors of Words | 25 | 2.50 | 1989 |
| Formal Properties of Finite Automata and Applications, LITP Spring School on Theoretical Computer Science, Ramatuelle, France, May 25-29, 1987, Proceedings | 18 | 2.72 | 1989 |
| New Results on the Generalized Star-Height Problem | 5 | 2.33 | 1989 |
| First-order logic and star-free sets | 66 | 3.46 | 1986 |
