The following pages link to Howard Straubing (Q599181):
Displaying 50 items.
- Families of recognizable sets corresponding to certain varieties of finite monoids (Q599182) (← links)
- A combinatorial proof of the Cayley-Hamilton theorem (Q789474) (← links)
- Non-uniform automata over groups (Q804303) (← links)
- Incomplete quadratic exponential sums in several variables (Q817737) (← links)
- Inversion of matrices over a commutative semiring (Q1057341) (← links)
- Locally trivial categories and unambiguous concatenation (Q1103056) (← links)
- Semigroups and languages of dot-depth two (Q1109125) (← links)
- Partially ordered finite monoids and a theorem of I. Simon (Q1111705) (← links)
- Applications of the theory of automata in enumeration (Q1122575) (← links)
- Recognizable sets and power sets of finite semigroups (Q1139135) (← links)
- On finite \(\mathcal J\)-trivial monoids (Q1140165) (← links)
- A generalization of the Schützenberger product of finite monoids (Q1150445) (← links)
- The variety generated by finite nilpotent monoids (Q1173163) (← links)
- Regular languages in \(NC\) (Q1191027) (← links)
- On a conjecture concerning dot-depth two languages (Q1200802) (← links)
- Some results on the generalized star-height problem (Q1207944) (← links)
- Aperiodic homomorphisms and the concatenation product of recognizable sets (Q1257988) (← links)
- Complex polynomials and circuit lower bounds for modular counting (Q1346614) (← links)
- Finite semigroup varieties defined by programs (Q1390876) (← links)
- Regular languages defined by generalized first-order formulas with a bounded number of bound variables (Q1405799) (← links)
- Lower bounds for modular counting by circuits with modular gates (Q1590077) (← links)
- Languages defined with modular counting quantifiers (Q1854424) (← links)
- Regular languages defined with generalized quantifiers (Q1892890) (← links)
- Superlinear lower bounds for bounded-width branching programs (Q1894446) (← links)
- Varieties (Q2074217) (← links)
- Finite semigroup varieties of the form V*D (Q2266068) (← links)
- Difference hierarchies and duality with an application to formal languages (Q2310785) (← links)
- Actions, wreath products of \(\mathcal C\)-varieties and concatenation product. (Q2490810) (← links)
- A note on \(\mathbf{MOD}_{p}\)-\(\mathbf{MOD}_{m}\) circuits (Q2509033) (← links)
- Bounds on an exponential sum arising in Boolean circuit complexity (Q2565522) (← links)
- On uniformity within \(NC^ 1\) (Q2640342) (← links)
- (Q2762532) (← links)
- Wreath Products of Forest Algebras, with Applications to Tree Logics (Q2914240) (← links)
- Algebraic Characterization of the Alternation Hierarchy in FO^2[<] on Finite Words (Q2915709) (← links)
- EF+EX Forest Algebras (Q2947153) (← links)
- (Q2957483) (← links)
- (Q3044318) (← links)
- (Q3044353) (← links)
- (Q3086935) (← links)
- (Q3123635) (← links)
- Piecewise testable tree languages (Q3166216) (← links)
- (Q3187179) (← links)
- WEAKLY ITERATED BLOCK PRODUCTS AND APPLICATIONS TO LOGIC AND COMPLEXITY (Q3561125) (← links)
- (Q3677937) (← links)
- (Q3689384) (← links)
- (Q3730029) (← links)
- (Q3760747) (← links)
- (Q3774066) (← links)
- (Q3806849) (← links)
- (Q3913600) (← links)
