| Two-variable logics with some betweenness relations: Expressiveness, satisfiability and membership. | 0 | 0.34 | 2019 |
| First-order logic and aperiodic languages: a revisionist history. | 0 | 0.34 | 2018 |
| Difference hierarchies and duality with an application to formal languages | 0 | 0.34 | 2018 |
| Wreath Products of Distributive Forest Algebras. | 0 | 0.34 | 2018 |
| An Algebraic Decision Procedure for Two-Variable Logic with a Between Relation. | 1 | 0.37 | 2018 |
| Two-variable Logic with a Between Predicate. | 0 | 0.34 | 2016 |
| Circuit Complexity of Powering in Fields of Odd Characteristic. | 0 | 0.34 | 2016 |
| Two-variable Logic with a Between Relation. | 2 | 0.40 | 2016 |
| EF plus EX Forest Algebras | 0 | 0.34 | 2015 |
| New applications of the wreath product of forest algebras. | 1 | 0.37 | 2013 |
| Piecewise Testable Tree Languages | 17 | 0.87 | 2012 |
| Wreath Products of Forest Algebras, with Applications to Tree Logics | 0 | 0.34 | 2012 |
| An effective characterization of the alternation hierarchy in two-variable logic | 5 | 0.46 | 2012 |
| Wreath Products of Forest Algebras, with Applications to Tree Logics | 7 | 0.68 | 2012 |
| Piecewise testable tree languages | 0 | 0.34 | 2012 |
| Algebraic Characterization of the Alternation Hierarchy in FO2[<] on Finite Words. | 2 | 0.40 | 2011 |
| An Introduction to Finite Automata and their Connection to Logic. | 4 | 0.44 | 2010 |
| Weakly Iterated Block Products And Applications To Logic And Complexity | 0 | 0.34 | 2010 |
| Modular quantifiers | 0 | 0.34 | 2008 |
| Actions, wreath products of C-varieties and concatenation product | 14 | 0.73 | 2006 |
| First Order Formulas with Modular Ppredicates | 12 | 0.56 | 2006 |
| Definability of languages by generalized first-order formulas over (N,+) | 5 | 0.44 | 2006 |
| A Note on MODp - MODm Circuits | 5 | 0.43 | 2006 |
| Inexpressibility results for regular languages in nonregular settings | 1 | 0.35 | 2005 |
| Some results on $\cal C$-varieties | 1 | 0.41 | 2005 |
| On Logical Descriptions of Regular Languages | 37 | 2.39 | 2002 |
| Weakly Iterated Block Products of Finite Monoids | 9 | 0.60 | 2002 |
| Regular Languages Defined by Generalized First-Order Formulas with a Bounded Number of Bound Variables | 0 | 0.34 | 2001 |
| Languages Defined with Modular Counting Quantifiers. | 4 | 0.47 | 2001 |
| Lower bounds for modular counting by circuits with modular gates | 4 | 0.51 | 1999 |
| Languages Defined With Modular Counting Quantifiers (Extended Abstract) | 0 | 0.34 | 1998 |
| Finite semigroup varieties defined by programs | 4 | 0.42 | 1997 |
| Finite Models, Automata, and Circuit Complexity | 1 | 0.44 | 1996 |
| The Power of Local Self-Reductions | 6 | 0.44 | 1995 |
| Complex polynomials and circuit lower bounds for modular counting | 12 | 0.99 | 1994 |
| Characterizations of regular languages in low level complexity classes | 5 | 0.56 | 1992 |
| Circuit Complexity and the Expressive Power of Generalized First-Order Formulas | 4 | 0.43 | 1992 |
| Regular languages in NC1 | 32 | 3.04 | 1992 |
| Superlinear lower bounds for bounded-width branching programs | 25 | 1.70 | 1991 |
| On uniformity within NC1 | 193 | 19.50 | 1990 |
| New Results on the Generalized Star-Height Problem | 5 | 2.33 | 1989 |
| Regular languages defined with generalized quantifiers | 40 | 2.15 | 1988 |
| Non-uniform automata over groups | 2 | 0.44 | 1987 |
| A combinatorial proof of the Cayley-Hamilton theorem | 14 | 9.13 | 1983 |
| A Generalization Of The Schutzenberger Product Of Finite Monoids | 47 | 3.27 | 1981 |
| Relationals Morphisms and Operations on Recognizable Sets | 7 | 0.79 | 1981 |
