{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:37:58Z","timestamp":1759639078416,"version":"3.40.3"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319986531"},{"type":"electronic","value":"9783319986548"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-98654-8_20","type":"book-chapter","created":{"date-parts":[[2018,8,4]],"date-time":"2018-08-04T19:43:57Z","timestamp":1533411837000},"page":"243-255","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Deque Languages, Automata and Planar Graphs"],"prefix":"10.1007","author":[{"given":"Stefano","family":"Crespi Reghizzi","sequence":"first","affiliation":[]},{"given":"Pierluigi","family":"San Pietro","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,8,5]]},"reference":[{"key":"20_CR1","unstructured":"Auer, C.: Planar graphs and their duals on cylinder surfaces. Ph.D. thesis, University of Passau (2014)"},{"key":"20_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1007\/978-3-642-18469-7_7","volume-title":"Graph Drawing","author":"C Auer","year":"2011","unstructured":"Auer, C., Bachmaier, C., Brandenburg, F.J., Brunner, W., Glei\u00dfner, A.: Plane drawings of queue and deque graphs. In: Brandes, U., Cornelsen, S. (eds.) GD 2010. LNCS, vol. 6502, pp. 68\u201379. Springer, Heidelberg (2011). \n                    https:\/\/doi.org\/10.1007\/978-3-642-18469-7_7"},{"key":"20_CR3","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/0304-3975(85)90164-1","volume":"40","author":"K Ayers","year":"1985","unstructured":"Ayers, K.: Deque automata and a subfamily of context-sensitive languages which contains all semilinear bounded languages. Theor. Comput. Sci. 40, 163\u2013174 (1985)","journal-title":"Theor. Comput. Sci."},{"issue":"8","key":"20_CR4","doi-asserted-by":"publisher","first-page":"1772","DOI":"10.1007\/s10910-015-0519-1","volume":"53","author":"S Barthel","year":"2015","unstructured":"Barthel, S., Buck, D.: Toroidal embeddings of abstractly planar graphs are knotted or linked. J. Math. Chem. 53(8), 1772\u20131790 (2015)","journal-title":"J. Math. Chem."},{"key":"20_CR5","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1016\/0304-3975(87)90115-0","volume":"52","author":"F Brandenburg","year":"1987","unstructured":"Brandenburg, F.: A note on: \u2018deque automata and a subfamily of context-sensitive languages which contains all semilinear bounded languages\u2019. Theor. Comput. Sci. 52, 341\u2013342 (1987)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"20_CR6","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1016\/0304-3975(91)90053-5","volume":"85","author":"A Cherubini","year":"1991","unstructured":"Cherubini, A., Citrini, C., Crespi-Reghizzi, S., Mandrioli, D.: QRT FIFO automata, breath-first grammars and their relations. Theor. Comput. Sci. 85(1), 171\u2013203 (1991)","journal-title":"Theor. Comput. Sci."},{"key":"20_CR7","volume-title":"Introduction to Automata Theory, Languages, and Computation","author":"J Hopcroft","year":"1979","unstructured":"Hopcroft, J., Ullman, J.: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Wokingham (1979)"},{"issue":"4","key":"20_CR8","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1007\/s00236-016-0258-1","volume":"54","author":"L Kari","year":"2017","unstructured":"Kari, L., Kulkarni, M.S.: Disjunctivity and other properties of sets of pseudo-bordered words. Acta Inf. 54(4), 379\u2013398 (2017)","journal-title":"Acta Inf."},{"key":"20_CR9","unstructured":"Knuth, D.E.: The Art of Computer Programming, Volume I: Fundamental Algorithms. Addison-Wesley, Boston (1968)"},{"key":"20_CR10","series-title":"Emergence, Complexity and Computation","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1007\/978-3-319-73216-9_19","volume-title":"Reversibility and Universality","author":"M Kutrib","year":"2018","unstructured":"Kutrib, M., Malcher, A., Wendlandt, M.: Queue automata: foundations and developments. In: Adamatzky, A. (ed.) Reversibility and Universality. ECC, vol. 30, pp. 385\u2013431. Springer, Cham (2018). \n                    https:\/\/doi.org\/10.1007\/978-3-319-73216-9_19"},{"issue":"1","key":"20_CR11","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1145\/322234.322246","volume":"28","author":"BL Leong","year":"1981","unstructured":"Leong, B.L., Seiferas, J.I.: New real-time simulations of multihead tape units. J. ACM 28(1), 166\u2013180 (1981)","journal-title":"J. ACM"},{"key":"20_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1007\/3-540-44679-6_24","volume-title":"Computing and Combinatorics","author":"H Petersen","year":"2001","unstructured":"Petersen, H.: Stacks versus deques. In: Wang, J. (ed.) COCOON 2001. LNCS, vol. 2108, pp. 218\u2013227. Springer, Heidelberg (2001). \n                    https:\/\/doi.org\/10.1007\/3-540-44679-6_24"},{"issue":"6912","key":"20_CR13","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1038\/nature01255","volume":"420","author":"DB Searls","year":"2002","unstructured":"Searls, D.B.: The language of genes. Nature 420(6912), 211\u2013217 (2002)","journal-title":"Nature"},{"key":"20_CR14","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1016\/0304-3975(80)90047-X","volume":"11","author":"B Vauquelin","year":"1980","unstructured":"Vauquelin, B., Franchi-Zannettacci, P.: Automates a file. Theor. Comput. Sci. 11, 221\u2013225 (1980)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"20_CR15","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/BF02234250","volume":"5","author":"R Vollmar","year":"1970","unstructured":"Vollmar, R.: \u00dcber einen Automaten mit Pufferspeicherung. Computing 5(1), 57\u201370 (1970)","journal-title":"Computing"}],"container-title":["Lecture Notes in Computer Science","Developments in Language Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-98654-8_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,9,2]],"date-time":"2018-09-02T19:12:33Z","timestamp":1535915553000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-98654-8_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319986531","9783319986548"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-98654-8_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]}}}