{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T06:55:10Z","timestamp":1725692110057},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642316432"},{"type":"electronic","value":"9783642316449"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-31644-9_9","type":"book-chapter","created":{"date-parts":[[2012,7,19]],"date-time":"2012-07-19T02:17:08Z","timestamp":1342664228000},"page":"138-144","source":"Crossref","is-referenced-by-count":0,"title":["The Boolean Formula Value Problem as Formal Language"],"prefix":"10.1007","author":[{"given":"Klaus-J\u00f6rn","family":"Lange","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"9_CR1","doi-asserted-by":"crossref","unstructured":"Alur, R.: Visibly Pushdown Languages. In: Proc. 36th ACM Symp. on Theory of Computing, pp. 202\u2013211 (2004)","DOI":"10.1145\/1007352.1007390"},{"key":"9_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1102","DOI":"10.1007\/11523468_89","volume-title":"Automata, Languages and Programming","author":"R. Alur","year":"2005","unstructured":"Alur, R., Kumar, V., Madhusudan, P., Viswanathan, M.: Congruences for Visibly Pushdown Languages. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol.\u00a03580, pp. 1102\u20131114. Springer, Heidelberg (2005)"},{"key":"9_CR3","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1016\/0022-0000(89)90037-8","volume":"38","author":"D.A. Barrington","year":"1989","unstructured":"Barrington, D.A.: Bounded-width polynomial-size branching programs can recognize exactly those languages in NC1. J. Comp. System Sci.\u00a038, 150\u2013164 (1989)","journal-title":"J. Comp. System Sci."},{"key":"9_CR4","unstructured":"Brumm, B.: Das Auswertungsproblem als formale Sprache. Private Communication (2011)"},{"key":"9_CR5","doi-asserted-by":"crossref","unstructured":"Buss, S.R.: The Boolean formula value problem is in ALOGTIME. In: Proc. 19th Ann. ACM Symp. on Theory of Computing, pp. 123\u2013131 (1987)","DOI":"10.1145\/28395.28409"},{"key":"9_CR6","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-2215-3","volume-title":"Varieties of Formal Languages","author":"J.E. Pin","year":"1986","unstructured":"Pin, J.E.: Varieties of Formal Languages. Plenum, London (1986)"}],"container-title":["Lecture Notes in Computer Science","Languages Alive"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-31644-9_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,4]],"date-time":"2019-05-04T03:17:35Z","timestamp":1556939855000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-31644-9_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642316432","9783642316449"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-31644-9_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}