{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,2]],"date-time":"2026-04-02T02:30:38Z","timestamp":1775097038735,"version":"3.50.1"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319097039","type":"print"},{"value":"9783319097046","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-09704-6_23","type":"book-chapter","created":{"date-parts":[[2014,7,11]],"date-time":"2014-07-11T05:43:21Z","timestamp":1405057401000},"page":"258-269","source":"Crossref","is-referenced-by-count":3,"title":["On the Complexity of L-reachability"],"prefix":"10.1007","author":[{"given":"Balagopal","family":"Komarath","sequence":"first","affiliation":[]},{"given":"Jayalal","family":"Sarma","sequence":"additional","affiliation":[]},{"given":"K. S.","family":"Sunil","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"23_CR1","doi-asserted-by":"crossref","unstructured":"Arora, S., Barak, B.: Computational Complexity: A Modern Approach. Cambridge University Press (2009)","DOI":"10.1017\/CBO9780511804090"},{"issue":"3","key":"23_CR2","doi-asserted-by":"publisher","first-page":"809","DOI":"10.1137\/S0097539798337716","volume":"30","author":"C.L. Barrett","year":"2000","unstructured":"Barrett, C.L., Jacob, R., Marathe, M.V.: Formal-language-constrained path problems. SIAM Journal of Computing\u00a030(3), 809\u2013837 (2000)","journal-title":"SIAM Journal of Computing"},{"issue":"1","key":"23_CR3","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1016\/0022-0000(89)90037-8","volume":"38","author":"D.A. Mix Barrington","year":"1989","unstructured":"Mix Barrington, D.A.: Bounded-width polynomial-size branching programs recognize exactly those languages in NC1. Journal of Computer and System Sciences\u00a038(1), 150\u2013164 (1989)","journal-title":"Journal of Computer and System Sciences"},{"key":"23_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/BFb0028550","volume-title":"STACS 98","author":"D.A. Mix Barrington","year":"1998","unstructured":"Mix Barrington, D.A., Lu, C.-J., Miltersen, P.B., Skyum, S.: Searching constant width mazes captures the AC0 hierarchy. In: Meinel, C., Morvan, M., Krob, D. (eds.) STACS 1998. LNCS, vol.\u00a01373, pp. 73\u201383. Springer, Heidelberg (1998)"},{"key":"23_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1007\/978-3-540-24749-4_5","volume-title":"STACS 2004","author":"K.A. Hansen","year":"2004","unstructured":"Hansen, K.A.: Constant width planar computation characterizes ACC0. In: Diekert, V., Habib, M. (eds.) STACS 2004. LNCS, vol.\u00a02996, pp. 44\u201355. Springer, Heidelberg (2004)"},{"key":"23_CR6","doi-asserted-by":"crossref","unstructured":"Hartmanis, J., Immerman, N., Mahaney, S.R.: One-way log-tape reductions. In: Proceedings of 19th Annual Symposium on Foundations of Computer Science, pp. 65\u201372 (1978)","DOI":"10.1109\/SFCS.1978.31"},{"key":"23_CR7","unstructured":"Hopcroft, J.E., Motwani, R., Ullman, J.D.: Introduction to automata theory, languages, and computation - international edition, 2nd edn. Addison-Wesley (2003)"},{"issue":"1","key":"23_CR8","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1145\/77606.77608","volume":"12","author":"S. Horwitz","year":"1990","unstructured":"Horwitz, S., Reps, T.W., Binkley, D.: Interprocedural slicing using dependence graphs. ACM Transactions on Programming Languages and Systems\u00a012(1), 26\u201360 (1990)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"23_CR9","doi-asserted-by":"crossref","unstructured":"Reingold, O.: Undirected connectivity in log-space. Journal of the ACM\u00a055(4) (2008)","DOI":"10.1145\/1391289.1391291"},{"issue":"8","key":"23_CR10","doi-asserted-by":"publisher","first-page":"739","DOI":"10.1007\/s002360050068","volume":"33","author":"T.W. Reps","year":"1996","unstructured":"Reps, T.W.: On the sequential nature of interprocedural program-analysis problems. Acta Informatica\u00a033(8), 739\u2013757 (1996)","journal-title":"Acta Informatica"},{"issue":"11-12","key":"23_CR11","doi-asserted-by":"publisher","first-page":"701","DOI":"10.1016\/S0950-5849(98)00093-7","volume":"40","author":"T.W. Reps","year":"1998","unstructured":"Reps, T.W.: Program analysis via graph reachability. Information & Software Technology\u00a040(11-12), 701\u2013726 (1998)","journal-title":"Information & Software Technology"},{"issue":"4","key":"23_CR12","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1145\/321906.321913","volume":"22","author":"I.H. Sudborough","year":"1975","unstructured":"Sudborough, I.H.: A note on tape-bounded complexity classes and linear context-free languages. Journal of the ACM\u00a022(4), 499\u2013500 (1975)","journal-title":"Journal of the ACM"},{"issue":"3","key":"23_CR13","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1145\/322077.322083","volume":"25","author":"I.H. Sudborough","year":"1978","unstructured":"Sudborough, I.H.: On the tape complexity of deterministic context-free languages. Journal of the ACM\u00a025(3), 405\u2013414 (1978)","journal-title":"Journal of the ACM"},{"key":"23_CR14","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/BF01762108","volume":"3","author":"J.D. Ullman","year":"1988","unstructured":"Ullman, J.D., van Gelder, A.: Parallel complexity of logical query programs. Algorithmica\u00a03, 5\u201342 (1988)","journal-title":"Algorithmica"},{"key":"23_CR15","doi-asserted-by":"crossref","unstructured":"Yannakakis, M.: Graph-theoretic methods in database theory. In: Proceedings of the 9th ACM Symposium on Principles of Database Systems, pp. 230\u2013242 (1990)","DOI":"10.1145\/298514.298576"}],"container-title":["Lecture Notes in Computer Science","Descriptional Complexity of Formal Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-09704-6_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,27]],"date-time":"2019-05-27T04:57:57Z","timestamp":1558933077000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-09704-6_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319097039","9783319097046"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-09704-6_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014]]}}}