Abstract
For each language \(L\subseteq{\textbf 2}^*\) and function t:ℕ → ℕ, we define another language \(t\ast L\subseteq{\textbf 2}^*\). We then prove that L ∈ NL/poly if and only if there exists k ∈ ℕ such that the projections \((n^k \ast L) \cap{\textbf 2}^n\) are accepted by nondeterministic finite automata of size polynomial in n. Therefore, proving super-polynomial lower bounds for unrestricted nondeterministic branching programs reduces to proving super-polynomial lower bounds for oblivious read-once nondeterministic branching programs i.e. nondeterministic finite automata.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Damm, C., Holzer, M.: Inductive counting below logspace. In: Privara, I., Ružička, P., Rovan, B. (eds.) MFCS 1994. LNCS, vol. 841, pp. 276–285. Springer, Heidelberg (1994)
Gruber, H., Holzer, M.: Finding lower bounds for nondeterministic state complexity is hard. In: Ibarra, O.H., Dang, Z. (eds.) DLT 2006. LNCS, vol. 4036, pp. 363–374. Springer, Heidelberg (2006)
Hromkovic, J.: Communication complexity and parallel computing. Texts in theoretical computer science. Springer (1997)
Hromkovic, J., Karhumki, J., Klauck, H., Schnitger, G., Seibert, S.: Measures of nondeterminism in finite automata. In: Welzl, E., Montanari, U., Rolim, J.D.P. (eds.) ICALP 2000. LNCS, vol. 1853, pp. 199–210. Springer, Heidelberg (2000)
Jukna, S.: Boolean Function Complexity - Advances and Frontiers. Algorithms and combinatorics, vol. 27. Springer (2012)
Jukna, S.: What have read-once branching programs to do with nl/poly? (2013), http://www.thi.informatik.uni-frankfurt.de/~jukna/boolean/comments.html (online, see Comment 12)
Karp, R.M., Lipton, R.J.: Some connections between nonuniform and uniform complexity classes. In: Proceedings of the Twelfth Annual ACM Symposium on Theory of Computing, STOC 1980, pp. 302–309. ACM, New York (1980)
Leung, H.: Tight lower bounds on the size of sweeping automata. J. Comput. Syst. Sci. 63(3), 384–393 (2001)
Razborov, A.A.: Lower bounds for deterministic and nondeterministic branching programs. In: Budach, L. (ed.) FCT 1991. LNCS, vol. 529, pp. 47–60. Springer, Heidelberg (1991)
Reinhardt, K., Allender, E.: Making nondeterminism unambiguous. In: Proceedings of the 38th Annual Symposium on Foundations of Computer Science, pp. 244–253 (1997)
Sakoda, W.J., Sipser, M.: Nondeterminism and the size of two way finite automata. In: STOC, pp. 275–286. ACM (1978)
Sipser, M.: Lower bounds on the size of sweeping automata. J. Comput. Syst. Sci. 21(2), 195–202 (1980)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Myers, R., Urbat, H. (2013). A Characterisation of NL/poly via Nondeterministic Finite Automata. In: Jurgensen, H., Reis, R. (eds) Descriptional Complexity of Formal Systems. DCFS 2013. Lecture Notes in Computer Science, vol 8031. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-39310-5_19
Download citation
DOI: https://doi.org/10.1007/978-3-642-39310-5_19
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-39309-9
Online ISBN: 978-3-642-39310-5
eBook Packages: Computer ScienceComputer Science (R0)