1. Bounded-width polynomial-size branching programs recognize exactly those languages in NC1;Mix Barrington;J. Comput. System Sci.,1989
2. On uniformity within NC1;Mix Barrington;J. Comput. System Sci.,1990
3. Linear circuits, two-variable logic and weakly blocked monoids;Behle,2007
4. Non-solvable groups are not in FO+MOD+MaˆJ2[reg];Behle,2009
5. Typed monoids – an Eilenberg-like theorem for non regular languages;Behle,2011