Two-way automata characterizations of L/poly versus NL

Let L/poly and NL be the standard complexity classes, of languages recognizable in logarithmic space by Turing machines which are deterministic with polynomially-long advice and nondeterministic without advice, respectively. We recast the question whether L/poly not superset of NL in terms of deterministic and nondeterministic two-way finite automata (2DFAS and 2NFAS). We prove it equivalent to the question whether every s-state unary 2NFA has an equivalent poly(s)-state 2DFA, or whether a poly(h)-state 2DFA can check accessibility in h-vertex graphs (even under unary encoding) or check two-way liveness in h-tall, h-column graphs. This complements two recent improvements of an old theorem of Berman and Lingas. On the way, we introduce new types of reductions between regular languages (even unary ones), use them to prove the completeness of specific languages for two-way nondeterministic polynomial size, and propose a purely combinatorial conjecturethat implies L/poly not superset of NL.