Relationals Morphisms and Operations on Recognizable Sets. - Howard Straubing (RAIRO Theor. Informatics Appl., 1981)

A Generalization of the Schützenberger Product of Finite Monoids. - Howard Straubing (Theor. Comput. Sci., 1981)

A combinatorial proof of the Cayley-Hamilton theorem. - Howard Straubing (Discret. Math., 1983)

Semigroups and Languages of Dot-Depth 2. - Howard Straubing (ICALP, 1986)

Applications of the theory of automata in enumeration. - Howard Straubing (Discret. Math., 1987)

On uniformity within NC1. - David A. Mix Barrington; Neil Immerman; Howard Straubing (SCT, 1988)

regular Languages Defined with Generalized Quantifiers. - Howard Straubing; Denis Thérien; Wolfgang Thomas (ICALP, 1988)

The wreath product and its applications. - Howard Straubing (Formal Properties of Finite Automata and Applications, 1988)

Finite automata and computational complexity. - Howard Straubing; Denis Thérien (Formal Properties of Finite Automata and Applications, 1988)

Semigroups and Languages of Dot-Depth Two. - Howard Straubing (Theor. Comput. Sci., 1988)

New Results on the Generalized Star-Height Problem. - Jean-Eric Pin; Howard Straubing; Denis Thérien (STACS, 1989)

On Uniformity within NC¹. - David A. Mix Barrington; Neil Immerman; Howard Straubing (J. Comput. Syst. Sci., 1990)

Non-Uniform Automata Over Groups - David A. Mix Barrington; Howard Straubing; Denis Thérien (Inf. Comput., 1990)

Constant-Depth periodic Circuits. - Howard Straubing (Int. J. Algebra Comput., 1991)

Circuit Complexity and the Expressive Power of Generalized First-Order Formulas. - Howard Straubing (ICALP, 1992)

Characterizations of regular languages in low level complexity classes. - Kevin J. Compton; Howard Straubing (Bull. EATCS, 1992)

Regular Languages in NC¹. - David A. Mix Barrington; Kevin J. Compton; Howard Straubing; Denis Thérien (J. Comput. Syst. Sci., 1992)

On a Conjecture Concerning Dot-Depth Two Languages. - Howard Straubing; Pascal Weil (Theor. Comput. Sci., 1992)

Some Results on the Generalized Star-Height Problem - Jean-Eric Pin; Howard Straubing; Denis Thérien (Inf. Comput., 1992)

Complex Polynomials and Circuit Lower Bounds for Modular Counting. - David A. Mix Barrington; Howard Straubing (Comput. Complex., 1994)

The Power of Local Self-Reductions - Richard Beigel; Howard Straubing (Electron. Colloquium Comput. Complex., 1995)

Superlinear Lower Bounds for Bounded-Width Branching Programs. - David A. Mix Barrington; Howard Straubing (J. Comput. Syst. Sci., 1995)

Regular Languages Defined with Generalized Quanifiers - Howard Straubing; Denis Thérien; Wolfgang Thomas (Inf. Comput., 1995)

Finite Models, Automata, and Circuit Complexity. - Howard Straubing (Descriptive Complexity and Finite Models, 1996)

Finite Semigroup Varieties Defined by Programs. - Pierre Péladeau; Howard Straubing; Denis Thérien (Theor. Comput. Sci., 1997)

Languages Defined With Modular Counting Quantifiers (Extended Abstract). - Howard Straubing (STACS, 1998)

Lower bounds for modular counting by circuits with modular gates. - David A. Mix Barrington; Howard Straubing (Comput. Complex., 1999)

Characterizations of Regular Languages in Low Level Complexity Classes. - Kevin J. Compton; Howard Straubing (Current Trends in Theoretical Computer Science, 2001)

Languages Defined with Modular Counting Quantifiers. - Howard Straubing (Inf. Comput., 2001)

On Logical Descriptions of Regular Languages. - Howard Straubing (LATIN, 2002)

Weakly Iterated Block Products of Finite Monoids. - Howard Straubing; Denis Thérien (LATIN, 2002)

Regular Languages Defined by Generalized First-Order Formulas with a Bounded Number of Bound Variables. - Howard Straubing; Denis Thérien (Theory Comput. Syst., 2003)

Inexpressibility Results for Regular Languages in Nonregular Settings. - Howard Straubing (Developments in Language Theory, 2005)

Some results on C-varieties. - Jean-Eric Pin; Howard Straubing (RAIRO Theor. Informatics Appl., 2005)

First Order Formulas with Modular Predicates. - Laura Chaubard; Jean-Eric Pin; Howard Straubing (LICS, 2006)

Definability of Languages by Generalized First-Order Formulas over (N, +). - Amitabha Roy 001; Howard Straubing (STACS, 2006)

A Note on MODp - MODm Circuits. - Howard Straubing; Denis Thérien (Theory Comput. Syst., 2006)

Actions, wreath products of C-varieties and concatenation product. - Laura Chaubard; Jean-Eric Pin; Howard Straubing (Theor. Comput. Sci., 2006)

Definability of Languages by Generalized First-Order Formulas over N+. - Amitabha Roy 001; Howard Straubing (SIAM J. Comput., 2007)

Modular quantifiers. - Howard Straubing; Denis Thérien (Logic and Automata, 2008)

An introduction to finite automata and their connection to logic - Howard Straubing; Pascal Weil (CoRR, 2010)

Weakly Iterated Block Products and Applications to Logic and Complexity. - Howard Straubing; Pascal Tesson; Denis Thérien (Int. J. Algebra Comput., 2010)

Algebraic Characterization of the Alternation Hierarchy in FO2[<] on Finite Words. - Howard Straubing (CSL, 2011)

An Introduction to Finite Automata and their Connection to Logic. - Howard Straubing; Pascal Weil (Modern Applications of Automata Theory, 2012)

Piecewise testable tree languages - Mikolaj Bojanczyk; Luc Segoufin; Howard Straubing (Log. Methods Comput. Sci., 2012)

Wreath Products of Forest Algebras, with Applications to Tree Logics - Mikolaj Bojanczyk; Howard Straubing; Igor Walukiewicz (Log. Methods Comput. Sci., 2012)

New applications of the wreath product of forest algebras. - Howard Straubing (RAIRO Theor. Informatics Appl., 2013)

EF+EX Forest Algebras. - Andreas Krebs; Howard Straubing (CAI, 2015)

Varieties. - Howard Straubing; Pascal Weil (CoRR, 2015)

A new proof of the locality of R. - Howard Straubing (Int. J. Algebra Comput., 2015)

Two-variable Logic with a Between Relation. - Andreas Krebs; Kamal Lodaya; Paritosh K. Pandya; Howard Straubing (LICS, 2016)

Circuit Complexity of Powering in Fields of Odd Characteristic. - Arkadev Chattopadhyay; Frederic Green; Howard Straubing (Chic. J. Theor. Comput. Sci., 2016)

Two-variable Logic with a Between Predicate. - Andreas Krebs; Kamal Lodaya; Paritosh K. Pandya; Howard Straubing (CoRR, 2016)

An Effective Characterization of the Alternation Hierarchy in Two-Variable Logic. - Andreas Krebs; Howard Straubing (ACM Trans. Comput. Log., 2017)

An Algebraic Decision Procedure for Two-Variable Logic with a Between Relation. - Andreas Krebs; Kamal Lodaya; Paritosh K. Pandya; Howard Straubing (CSL, 2018)

Wreath Products of Distributive Forest Algebras. - Michael Hahn 001; Andreas Krebs; Howard Straubing (LICS, 2018)

Forest Categories. - Howard Straubing (CoRR, 2018)

Difference hierarchies and duality with an application to formal languages. - Célia Borlido; Mai Gehrke; Andreas Krebs; Howard Straubing (CoRR, 2018)

First-order logic and aperiodic languages: a revisionist history. - Howard Straubing (ACM SIGLOG News, 2018)

Two-variable logics with some betweenness relations: Expressiveness, satisfiability and membership. - Andreas Krebs; Kamal Lodaya; Paritosh K. Pandya; Howard Straubing (Log. Methods Comput. Sci., 2020)

Varieties. - Howard Straubing; Pascal Weil (Handbook of Automata Theory (I.), 2021)

Regular languages defined by first-order formulas without quantifier alternation. - Andreas Krebs; Howard Straubing (CoRR, 2022)