{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:26:41Z","timestamp":1725492401760},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540403913"},{"type":"electronic","value":"9783540449775"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-44977-9_3","type":"book-chapter","created":{"date-parts":[[2007,10,16]],"date-time":"2007-10-16T10:20:28Z","timestamp":1192530028000},"page":"35-46","source":"Crossref","is-referenced-by-count":0,"title":["Bidirectional Push Down Automata"],"prefix":"10.1007","author":[{"given":"Miguel A.","family":"Alonso","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"V\u00edctor J.","family":"D\u00edaz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Manuel","family":"Vilares","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2003,6,24]]},"reference":[{"key":"3_CR1","unstructured":"Miguel A. Alonso, V\u00edctor J. D\u00edaz, and Manuel Vilares. Bidirectional automata for tree adjoining grammars. In Proc. of the Seventh International Workshop on Parsing Technologies (IWPT-2001), pages 42\u201353, Beijing, China, October 2001. Tsinghua University Press."},{"key":"3_CR2","unstructured":"Eric de la Clergerie. Automates \u00e0 Piles et Programmation Dynamique. DyALog: Une Application \u00e0 la Programmation en Logique. PhD thesis, Universit\u00e9 Paris 7, Paris, France, 1993."},{"key":"3_CR3","unstructured":"Eric de la Clergerie and Bernard Lang. LPDA: Another look at tabulation in logic programming. In Van Hentenryck, editor, Proc. of the 11th International Conference on Logic Programming (ICLP\u201994), pages 470\u2013486. MIT Press, June 1994."},{"issue":"2","key":"3_CR4","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1145\/362007.362035","volume":"13","author":"J. Earley","year":"1970","unstructured":"J. Earley. An efficient context-free parsing algorithm. Communications of the ACM, 13(2):94\u2013102, 1970.","journal-title":"Communications of the ACM"},{"key":"3_CR5","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1007\/978-1-4615-3986-5_11","volume-title":"Current Issues in Parsing Technology","author":"B. Lang","year":"1991","unstructured":"Bernard Lang. Towards a uniform formal framework for parsing. In Masaru Tomita, editor, Current Issues in Parsing Technology, pages 153\u2013171. Kluwer Academic Publishers, Norwell, MA, USA, 1991."},{"key":"3_CR6","doi-asserted-by":"crossref","unstructured":"Mark-Jan Nederhof. An optimal tabular parsing algorithm. In Proc. of 32nd Annual Meeting of the Association for Computational Linguistics, pages 117\u2013124, Las Cruces, NM, USA, June 1994. ACL.","DOI":"10.3115\/981732.981749"},{"key":"3_CR7","first-page":"472","volume-title":"Developments in Language Theory II","author":"M.-J. Nederhof","year":"1996","unstructured":"Mark-Jan Nederhof. Reversible pushdown automata and bidirectional parsing. In J. Dassow, G. Rozenberg, and A. Salomaa, editors, Developments in Language Theory II, pages 472\u2013481. World Scientific, Singapore, 1996."},{"issue":"1\u20132","key":"3_CR8","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/0743-1066(95)00035-I","volume":"24","author":"S. M. Shieber","year":"1995","unstructured":"Stuart M. Shieber, Yves Schabes, and Fernando C. N. Pereira. Principles and implementation of deductive parsing. Journal of Logic Programming, 24(1\u20132):3\u201336, July\u2013August 1995.","journal-title":"Journal of Logic Programming"},{"key":"3_CR9","volume-title":"Texts in Theoretical Computer Science-An EATCS Series","author":"K. Sikkel","year":"1997","unstructured":"Klaas Sikkel. Parsing Schemata-A Framework for Specification and Analysis of Parsing Algorithms. Texts in Theoretical Computer Science-An EATCS Series. Springer-Verlag, Berlin\/Heidelberg\/New York, 1997."}],"container-title":["Lecture Notes in Computer Science","Implementation and Application of Automata"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44977-9_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,24]],"date-time":"2019-02-24T04:03:47Z","timestamp":1550981027000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44977-9_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540403913","9783540449775"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/3-540-44977-9_3","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2003]]}}}