{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,31]],"date-time":"2026-01-31T17:49:49Z","timestamp":1769881789829,"version":"3.49.0"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783031191343","type":"print"},{"value":"9783031191350","type":"electronic"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-19135-0_6","type":"book-chapter","created":{"date-parts":[[2022,10,11]],"date-time":"2022-10-11T23:03:49Z","timestamp":1665529429000},"page":"77-92","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Unambiguity and\u00a0Fewness for\u00a0Nonuniform Families of\u00a0Polynomial-Size Nondeterministic Finite Automata"],"prefix":"10.1007","author":[{"given":"Tomoyuki","family":"Yamakami","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,10,12]]},"reference":[{"key":"6_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-16486-3_85","volume-title":"Structure in Complexity Theory","author":"EW Allender","year":"1986","unstructured":"Allender, E.W.: The complexity of sparse sets in P. In: Selman, A.L. (ed.) Structure in Complexity Theory. LNCS, vol. 223, pp. 1\u201311. Springer, Heidelberg (1986). https:\/\/doi.org\/10.1007\/3-540-16486-3_85"},{"key":"6_CR2","doi-asserted-by":"publisher","first-page":"1193","DOI":"10.1137\/0217075","volume":"17","author":"E Allender","year":"1988","unstructured":"Allender, E., Rubinstein, R.: P-printable sets. SIAM J. Comput. 17, 1193\u20131202 (1988)","journal-title":"SIAM J. Comput."},{"key":"6_CR3","unstructured":"Berman P., Lingas, A.: On complexity of regular languages in terms of finite automata, Report 304, Institute of Computer Science, Polish Academy of Science, Warsaw (1977)"},{"key":"6_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1490270.1490274","volume":"1","author":"C Bourke","year":"2009","unstructured":"Bourke, C., Tewari, R., Vinodchandran, N.V.: Directed planar reachability is in unambiguous log-space. ACM Trans. Comput. Theory 1, 1\u201317 (2009)","journal-title":"ACM Trans. Comput. Theory"},{"key":"6_CR5","doi-asserted-by":"crossref","unstructured":"Buntrock, G., Jenner, B., Lange, K., Rossmanith, P.: Unambiguity and fewness for logarithmic space. In: the Proceedings of FCT1991, LNCS vol. 529, pp. 168\u2013179 (1991)","DOI":"10.1007\/3-540-54458-5_61"},{"key":"6_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/978-3-642-02737-6_4","volume-title":"Developments in Language Theory","author":"CA Kapoutsis","year":"2009","unstructured":"Kapoutsis, C.A.: Size complexity of two-way finite automata. In: Diekert, V., Nowotka, D. (eds.) DLT 2009. LNCS, vol. 5583, pp. 47\u201366. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-02737-6_4"},{"key":"6_CR7","first-page":"205","volume":"17","author":"CA Kapoutsis","year":"2012","unstructured":"Kapoutsis, C.A.: Minicomplexity. J. Automat. Lang. Combin. 17, 205\u2013224 (2012)","journal-title":"J. Automat. Lang. Combin."},{"key":"6_CR8","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1007\/s00224-013-9465-0","volume":"55","author":"CA Kapoutsis","year":"2014","unstructured":"Kapoutsis, C.A.: Two-way automata versus logarithmic space. Theory Comput. Syst. 55, 421\u2013447 (2014)","journal-title":"Theory Comput. Syst."},{"key":"6_CR9","doi-asserted-by":"crossref","unstructured":"Kapoutsis, C.A., Pighizzini, G.: Two-way automata characterizations of L\/poly versus NL. Theory Comput. Syst. 56, 662\u2013685 (2015)","DOI":"10.1007\/s00224-014-9560-x"},{"key":"6_CR10","first-page":"191","volume":"28","author":"RM Karp","year":"1982","unstructured":"Karp, R.M., Lipton, R.J.: Tring machines that take advice. L\u2019Enseigrement Math\u00e9matique 28, 191\u2013209 (1982)","journal-title":"L\u2019Enseigrement Math\u00e9matique"},{"key":"6_CR11","doi-asserted-by":"publisher","unstructured":"Li, M., Vit\u00e1nyi, P.: An Introduction to Kolmogorov Complexity and Its Applications. Third edition. Springer, Cham (2008). https:\/\/doi.org\/10.1007\/978-0-387-49820-1","DOI":"10.1007\/978-0-387-49820-1"},{"key":"6_CR12","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1007\/s00037-012-0047-3","volume":"21","author":"A Pavan","year":"2012","unstructured":"Pavan, A., Tewari, R., Vinodchandran, N.V.: On the power of unambiguity in logspace. Comput. Complex. 21, 643\u2013670 (2012)","journal-title":"Comput. Complex."},{"key":"6_CR13","doi-asserted-by":"publisher","first-page":"1118","DOI":"10.1137\/S0097539798339041","volume":"29","author":"K Reinhardt","year":"2000","unstructured":"Reinhardt, K., Allender, E.: Making nondeterminism unambiguous. SIAM J. Comput. 29, 1118\u20131131 (2000)","journal-title":"SIAM J. Comput."},{"key":"6_CR14","doi-asserted-by":"crossref","unstructured":"Sakoda, W.J., Sipser, M.: Nondeterminism and the size of two-way finite automata. In: the Proceedings of STOC 1978, pp. 275\u2013286 (1978)","DOI":"10.1145\/800133.804357"},{"key":"6_CR15","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1016\/0020-0190(76)90097-1","volume":"5","author":"L Valiant","year":"1976","unstructured":"Valiant, L.: The relative complexity of checking and evaluating. Inf. Process. Lett. 5, 20\u201323 (1976)","journal-title":"Inf. Process. Lett."},{"key":"6_CR16","unstructured":"Yamakami, T.: The 2CNF Boolean formula satisfiability problem and the linear space hypothesis. In: the Proceedings of MFCS 2017, LIPIcs, vol. 83, 1\u201314 (2017). arXiv preprint arXiv:1709.10453"},{"key":"6_CR17","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1016\/j.tcs.2019.09.006","volume":"798","author":"T Yamakami","year":"2019","unstructured":"Yamakami, T.: State complexity characterizations of parameterized degree-bounded graph connectivity, sub-linear space computation, and the linear space hypothesis. Theor. Comput. Sci. 798, 2\u201322 (2019)","journal-title":"Theor. Comput. Sci."},{"key":"6_CR18","doi-asserted-by":"crossref","unstructured":"Yamakami, T.: Nonuniform families of polynomial-size quantum finite automata and quantum logarithmic-space computation with polynomial-size advice. Inform. Comput. 286, 104783 (2022). A preliminary version appeared in the Proceedings of LATA 2019, LNCS, vol. 11417, pp. 134\u2013145 (2019)","DOI":"10.1016\/j.ic.2021.104783"},{"key":"6_CR19","doi-asserted-by":"crossref","unstructured":"Yamakami, T.: Relativizations of nonuniform quantum finite automata families. In: the Proceedings of UCNC 2019, LNCS, vol. 11493, pp. 257\u2013271 (2019)","DOI":"10.1007\/978-3-030-19311-9_20"},{"key":"6_CR20","unstructured":"Yamakami, T.: Parameterizations of logarithmic-space reductions, stack-state complexity of nonuniform families of pushdown automata, and a road to the LOGCFL$$\\subseteq $$LOGDCFL\/poly question. arXiv preprint arXiv:2108.12779 (2021)"}],"container-title":["Lecture Notes in Computer Science","Reachability Problems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-19135-0_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,11]],"date-time":"2022-10-11T23:09:52Z","timestamp":1665529792000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-19135-0_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031191343","9783031191350"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-19135-0_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"12 October 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"RP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Reachability Problems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Kaiserslautern","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 October 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 October 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"rp2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/rp2022.mpi-sws.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"14","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"8","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"57% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3 invited talks are also included.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}