| On uniformity within NC1 DAM Barrington, N Immerman, H Straubing Journal of Computer and System Sciences 41 (3), 274-306, 1990 | 729 | 1990 |
| Finite automata, formal logic, and circuit complexity H Straubing Springer Science & Business Media, 2012 | 646 | 2012 |
| Finite semigroup varieties of the form V∗ D H Straubing Journal of Pure and Applied Algebra 36, 53-94, 1985 | 223 | 1985 |
| Regular languages in NC1 DAM Barrington, K Compton, H Straubing, D Thérien Journal of Computer and System Sciences 44 (3), 478-499, 1992 | 162 | 1992 |
| A generalization of the Schützenberger product of finite monoids H Straubing Theoretical Computer Science 13 (2), 137-150, 1981 | 157 | 1981 |
| Inversion of matrices over a commutative semiring C Reutenauer, H Straubing Journal of Algebra 88 (2), 350-360, 1984 | 140 | 1984 |
| Non-uniform automata over groups DAM Barrington, H Straubing, D Thérien Information and Computation 89 (2), 109-132, 1990 | 136 | 1990 |
| On logical descriptions of regular languages H Straubing LATIN 2002: Theoretical Informatics: 5th Latin American Symposium Cancun …, 2002 | 96 | 2002 |
| Families of recognizable sets corresponding to certain varieties of finite monoids H Straubing Journal of Pure and Applied Algebra 15 (3), 305-318, 1979 | 88 | 1979 |
| A combinatorial proof of the Cayley-Hamilton theorem H Straubing Discrete Mathematics 43 (2-3), 273-279, 1983 | 87 | 1983 |
| Locally trivial categories and unambiguous concatenation JÉ Pin, H Straubing, D Thérien Journal of Pure and Applied Algebra 52 (3), 297-311, 1988 | 85 | 1988 |
| Aperiodic homomorphisms and the concatenation product of recognizable sets H Straubing Journal of Pure and Applied Algebra 15 (3), 319-327, 1979 | 81 | 1979 |
| Partially ordered finite monoids and a theorem of I. Simon H Straubing, D Thérien Journal of Algebra 119 (2), 393-399, 1988 | 80 | 1988 |
| Semigroups and languages of dot-depth two H Straubing Theoretical Computer Science 58 (1-3), 361-378, 1988 | 78* | 1988 |
| Monoids of upper triangular boolean matrices JÉ Pin, H Straubing Semigroups. Structure and Universal AIgebraic Problems 39, 259-272, 1981 | 77 | 1981 |
| Regular languages defined with generalized quantifiers H Straubing, D Thérien, W Thomas Information and computation 118 (2), 289-301, 1995 | 71 | 1995 |
| Piecewise testable tree languages M Bojańczyk, L Segoufin, H Straubing Logical Methods in Computer Science 8, 2012 | 65 | 2012 |
| Superlinear lower bounds for bounded-width branching programs DAM Barrington, H Straubing Journal of Computer and System Sciences 50 (3), 374-381, 1995 | 58 | 1995 |
| Some results on C-varieties JÉ Pin, H Straubing RAIRO-Theoretical Informatics and Applications 39 (1), 239-262, 2005 | 54 | 2005 |
| On finite ℐ-trivial monoids H Straubing Semigroup Forum 19, 107-110, 1980 | 52 | 1980 |
Jean-Eric PinCNRSE-mailová adresa ověřena na: liafa.univ-paris-diderot.fr
