{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,16]],"date-time":"2026-07-16T18:53:23Z","timestamp":1784228003233,"version":"3.55.0"},"publisher-location":"Berlin, Heidelberg","reference-count":54,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642316432","type":"print"},{"value":"9783642316449","type":"electronic"}],"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_13","type":"book-chapter","created":{"date-parts":[[2012,7,18]],"date-time":"2012-07-18T22:17:08Z","timestamp":1342649828000},"page":"186-206","source":"Crossref","is-referenced-by-count":7,"title":["Descriptional Complexity of Input-Driven Pushdown Automata"],"prefix":"10.1007","author":[{"given":"Alexander","family":"Okhotin","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xiaoxue","family":"Piao","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kai","family":"Salomaa","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"13_CR1","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":"13_CR2","doi-asserted-by":"crossref","unstructured":"Alur, R., Madhusudan, P.: Visibly pushdown languages. In: Proceedings of ACM Symposium on Theory of Computing, STOC 2004, Chicago, USA, pp. 202\u2013211 (2004)","DOI":"10.1145\/1007352.1007390"},{"key":"13_CR3","doi-asserted-by":"crossref","unstructured":"Alur, R., Madhusudan, P.: Adding nesting structure to words. J. Assoc. Comput. Mach. 56(3) (2009)","DOI":"10.1145\/1516512.1516518"},{"key":"13_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"888","DOI":"10.1007\/978-3-540-73420-8_76","volume-title":"Automata, Languages and Programming","author":"M. Arenas","year":"2007","unstructured":"Arenas, M., Barcel\u00f3, P., Libkin, L.: Regular Languages of Nested Words: Fixed Points, Automata, and Synchronization. In: Arge, L., Cachin, C., Jurdzi\u0144ski, T., Tarlecki, A. (eds.) ICALP 2007. LNCS, vol.\u00a04596, pp. 888\u2013900. Springer, Heidelberg (2007)"},{"key":"13_CR5","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1016\/0020-0190(92)90198-5","volume":"43","author":"J.-C. Birget","year":"1992","unstructured":"Birget, J.-C.: Intersection and union of regular languages and state complexity. Inform. Process. Lett.\u00a043, 185\u2013190 (1992)","journal-title":"Inform. Process. Lett."},{"key":"13_CR6","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1016\/0304-3975(93)90160-U","volume":"119","author":"J.-C. Birget","year":"1993","unstructured":"Birget, J.-C.: Partial orders on words, minimal elements of regular languages, and state complexity. Theoret. Comput. Sci.\u00a0119, 267\u2013291 (1993)","journal-title":"Theoret. Comput. Sci."},{"key":"13_CR7","doi-asserted-by":"crossref","unstructured":"Bollig, B.: On the expressive power of 2-stack visibly pushdown automata. Logical Methods in Computer Science 4(4), paper 16 (2008)","DOI":"10.2168\/LMCS-4(4:16)2008"},{"key":"13_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1007\/3-540-12689-9_92","volume-title":"Foundations of Computation Theory","author":"B. Braunm\u00fchl von","year":"1983","unstructured":"von Braunm\u00fchl, B., Verbeek, R.: Input-Driven Languages are Recognized in logn Space. In: Karpinski, M. (ed.) FCT 1983. LNCS, vol.\u00a0158, pp. 40\u201351. Springer, Heidelberg (1983)"},{"key":"13_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0304-0208(08)73072-X","volume":"102","author":"B. Braunm\u00fchl von","year":"1985","unstructured":"von Braunm\u00fchl, B., Verbeek, R.: Input driven languages are recognized in logn space. North-Holland Mathematics Studies\u00a0102, 1\u201319 (1985)","journal-title":"North-Holland Mathematics Studies"},{"key":"13_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1007\/978-3-540-73208-2_15","volume-title":"Developments in Language Theory","author":"D. Carotenuto","year":"2007","unstructured":"Carotenuto, D., Murano, A., Peron, A.: 2-Visibly Pushdown Automata. In: Harju, T., Karhum\u00e4ki, J., Lepist\u00f6, A. (eds.) DLT 2007. LNCS, vol.\u00a04588, pp. 132\u2013144. Springer, Heidelberg (2007)"},{"key":"13_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/978-3-540-74456-6_14","volume-title":"Mathematical Foundations of Computer Science 2007","author":"P. Chervet","year":"2007","unstructured":"Chervet, P., Walukiewicz, I.: Minimizing Variants of Visibly Pushdown Automata. In: Ku\u010dera, L., Ku\u010dera, A. (eds.) MFCS 2007. LNCS, vol.\u00a04708, pp. 135\u2013146. Springer, Heidelberg (2007)"},{"key":"13_CR12","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/0304-3975(86)90142-8","volume":"47","author":"M. Chrobak","year":"1986","unstructured":"Chrobak, M.: Finite automata and unary languages. Theoret. Comput. Sci.\u00a047, 149\u2013158 (1986), Errata 302, 497\u2013498 (2003)","journal-title":"Theoret. Comput. Sci."},{"key":"13_CR13","first-page":"35","volume":"83","author":"J. Dassow","year":"2008","unstructured":"Dassow, J., Stiebe, R.: Nonterminal complexity of some operations on context-free languages. Fundam. Inform.\u00a083, 35\u201349 (2008)","journal-title":"Fundam. Inform."},{"key":"13_CR14","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1016\/S0020-0190(02)00316-2","volume":"84","author":"M. Domaratzki","year":"2002","unstructured":"Domaratzki, M., Pighizzini, G., Shallit, J.: Simulating finite automata with context-free grammars. Inform. Proc. Lett.\u00a084, 339\u2013344 (2002)","journal-title":"Inform. Proc. Lett."},{"key":"13_CR15","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1016\/0020-0190(88)90148-2","volume":"26","author":"P. Dymond","year":"1988","unstructured":"Dymond, P.: Input-driven languages are in logn depth. Inform. Process. Lett.\u00a026, 247\u2013250 (1988)","journal-title":"Inform. Process. Lett."},{"key":"13_CR16","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1016\/0022-0000(80)90058-6","volume":"20","author":"J. Engelfriet","year":"1980","unstructured":"Engelfriet, J., Rozenberg, G., Slutzki, G.: Tree transducers, L systems, and two-way machines. J. Comput. System Sci.\u00a020, 150\u2013202 (1980)","journal-title":"J. Comput. System Sci."},{"key":"13_CR17","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1016\/j.ipl.2008.08.002","volume":"109","author":"O. Gauwin","year":"2008","unstructured":"Gauwin, O., Niehren, J., Roos, Y.: Streaming tree automata. Inform. Proc. Lett.\u00a0109, 13\u201317 (2008)","journal-title":"Inform. Proc. Lett."},{"key":"13_CR18","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/0020-0190(96)00095-6","volume":"59","author":"I. Glaister","year":"1996","unstructured":"Glaister, I., Shallit, J.: A lower bound technique for the size of nondeterministic finite automata. Inform. Process. Lett.\u00a059, 75\u201377 (1996)","journal-title":"Inform. Process. Lett."},{"key":"13_CR19","unstructured":"Gruska, J.: Descriptional complexity of context-free languages. In: Mathematical Foundations of Computer Science (MFCS 1973), Strbsk\u00e9 Pleso, High Tatras, Czechoslovakia, September 3-8, pp. 71\u201383 (1973)"},{"key":"13_CR20","doi-asserted-by":"publisher","first-page":"2961","DOI":"10.1016\/j.tcs.2009.01.004","volume":"410","author":"Y.-S. Han","year":"2009","unstructured":"Han, Y.-S., Salomaa, K.: Nondeterministic state complexity of nested word automata. Theoret. Comput. Sci.\u00a0410, 2961\u20132971 (2009)","journal-title":"Theoret. Comput. Sci."},{"key":"13_CR21","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1137\/0209010","volume":"9","author":"J. Hartmanis","year":"1980","unstructured":"Hartmanis, J.: On the succinctness of different representations of languages. SIAM J. Comput.\u00a09, 114\u2013120 (1980)","journal-title":"SIAM J. Comput."},{"key":"13_CR22","doi-asserted-by":"publisher","first-page":"1087","DOI":"10.1142\/S0129054103002199","volume":"14","author":"M. Holzer","year":"2003","unstructured":"Holzer, M., Kutrib, M.: Nondeterministic descriptional complexity of regular languages. Internat. J. Foundations of Comput. Sci.\u00a014, 1087\u20131102 (2003)","journal-title":"Internat. J. Foundations of Comput. Sci."},{"key":"13_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-70844-5_1","volume-title":"Implementation and Applications of Automata","author":"M. Holzer","year":"2008","unstructured":"Holzer, M., Kutrib, M.: Nondeterministic Finite Automata\u2014Recent Results on the Descriptional and Computational Complexity. In: Ibarra, O.H., Ravikumar, B. (eds.) CIAA 2008. LNCS, vol.\u00a05148, pp. 1\u201316. Springer, Heidelberg (2008)"},{"key":"13_CR24","doi-asserted-by":"publisher","first-page":"456","DOI":"10.1016\/j.ic.2010.11.013","volume":"209","author":"M. Holzer","year":"2011","unstructured":"Holzer, M., Kutrib, M.: Descriptional and computational complexity of finite automata\u2014A survey. Inf. Comput.\u00a0209, 456\u2013470 (2011)","journal-title":"Inf. Comput."},{"key":"13_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1007\/978-3-540-85780-8_35","volume-title":"Developments in Language Theory","author":"G. Jir\u00e1skov\u00e1","year":"2008","unstructured":"Jir\u00e1skov\u00e1, G., Okhotin, A.: On the State Complexity of Operations on Two-Way Finite Automata. In: Ito, M., Toyama, M. (eds.) DLT 2008. LNCS, vol.\u00a05257, pp. 443\u2013454. Springer, Heidelberg (2008)"},{"key":"13_CR26","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1016\/S0019-9958(81)90438-1","volume":"49","author":"T. Kamimura","year":"1981","unstructured":"Kamimura, T., Slutzki, G.: Parallel and two-way automata on directed ordered acyclic graphs. Inform. Control\u00a049, 10\u201351 (1981)","journal-title":"Inform. Control"},{"key":"13_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"544","DOI":"10.1007\/11549345_47","volume-title":"Mathematical Foundations of Computer Science 2005","author":"C.A. Kapoutsis","year":"2005","unstructured":"Kapoutsis, C.A.: Removing Bidirectionality from Nondeterministic Finite Automata. In: Jedrzejowicz, J., Szepietowski, A. (eds.) MFCS 2005. LNCS, vol.\u00a03618, pp. 544\u2013555. Springer, Heidelberg (2005)"},{"key":"13_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"324","DOI":"10.1007\/978-3-642-22321-1_28","volume-title":"Developments in Language Theory","author":"M. Kunc","year":"2011","unstructured":"Kunc, M., Okhotin, A.: Describing Periodicity in Two-Way Deterministic Finite Automata Using Transformation Semigroups. In: Mauri, G., Leporati, A. (eds.) DLT 2011. LNCS, vol.\u00a06795, pp. 324\u2013336. Springer, Heidelberg (2011)"},{"key":"13_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"222","DOI":"10.1007\/978-3-642-22600-7_18","volume-title":"DCFS 2011","author":"M. Kunc","year":"2011","unstructured":"Kunc, M., Okhotin, A.: State Complexity of Operations on Two-Way Deterministic Finite Automata over a Unary Alphabet. In: Holzer, M. (ed.) DCFS 2011. LNCS, vol.\u00a06808, pp. 222\u2013234. Springer, Heidelberg (2011)"},{"key":"13_CR30","doi-asserted-by":"crossref","unstructured":"La Torre, S., Madhusudan, P., Parlato, G.: A robust class of context-sensitive languages. In: Proceedings of the 22nd IEEE Symposium on Logic in Computer Science, LICS, pp. 161\u2013170. IEEE Computer Society Press (2007)","DOI":"10.1109\/LICS.2007.9"},{"key":"13_CR31","unstructured":"La Torre, S., Madhusudan, P., Parlato, G.: A note posted at, \n                  \n                    http:\/\/www.cs.uicu.edu\/~madhu\/vpa\/wrong-proof-CMP07.html"},{"key":"13_CR32","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1016\/S0304-3975(81)80005-9","volume":"13","author":"E.L. Leiss","year":"1981","unstructured":"Leiss, E.L.: Succinct representation of regular languages by Boolean automata. Theoret. Comput. Sci.\u00a013, 323\u2013330 (1981)","journal-title":"Theoret. Comput. Sci."},{"issue":"5","key":"13_CR33","doi-asserted-by":"publisher","first-page":"975","DOI":"10.1142\/S0129054105003418","volume":"16","author":"H. Leung","year":"2005","unstructured":"Leung, H.: Descriptional complexity of NFA of different ambiguity. Internat. J. Foundations Comput. Sci.\u00a016(5), 975\u2013984 (2005)","journal-title":"Internat. J. Foundations Comput. Sci."},{"key":"13_CR34","first-page":"321","volume":"9","author":"O.B. Lupanov","year":"1963","unstructured":"Lupanov, O.B.: A comparison of two types of finite automata. Problemy Kibernetiki\u00a09, 321\u2013326 (1963) (in Russian)","journal-title":"Problemy Kibernetiki"},{"key":"13_CR35","doi-asserted-by":"crossref","unstructured":"Madhusudan, P., Parlato, G.: The tree width of auxiliary storage. In: Proc. 38th ACM Symposium on Principles of Programming Languages, POPL 2011, pp. 283\u2013294 (2011)","DOI":"10.1145\/1926385.1926419"},{"key":"13_CR36","first-page":"1373","volume":"11","author":"A.N. Maslov","year":"1970","unstructured":"Maslov, A.N.: Estimates of the number of states of finite automata. Soviet Mathematics Doklady\u00a011, 1373\u20131375 (1970)","journal-title":"Soviet Mathematics Doklady"},{"key":"13_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1007\/3-540-10003-2_89","volume-title":"Automata, Languages and Programming","author":"K. Mehlhorn","year":"1980","unstructured":"Mehlhorn, K.: Pebbling Mountain Ranges and its Application to DCFL-Recognition. In: de Bakker, J.W., van Leeuwen, J. (eds.) ICALP 1980. LNCS, vol.\u00a085, pp. 422\u2013435. Springer, Heidelberg (1980)"},{"issue":"6","key":"13_CR38","doi-asserted-by":"publisher","first-page":"1976","DOI":"10.1137\/S009753979935431X","volume":"30","author":"C. Mereghetti","year":"2001","unstructured":"Mereghetti, C., Pighizzini, G.: Optimal simulations between unary automata. SIAM J. Comput.\u00a030(6), 1976\u20131992 (2001)","journal-title":"SIAM J. Comput."},{"key":"13_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1007\/978-3-540-49382-2_12","volume-title":"Foundations of Software Technology and Theoretical Computer Science","author":"A. Neumann","year":"1998","unstructured":"Neumann, A., Seidl, H.: Locating Matches of Tree Patterns in Forests. In: Arvind, V., Sarukkai, S. (eds.) FST TCS 1998. LNCS, vol.\u00a01530, pp. 134\u2013146. Springer, Heidelberg (1998)"},{"key":"13_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/978-3-540-74456-6_13","volume-title":"Mathematical Foundations of Computer Science 2007","author":"D. Nowotka","year":"2007","unstructured":"Nowotka, D., Srba, J.: Height-Deterministic Pushdown Automata. In: Ku\u010dera, L., Ku\u010dera, A. (eds.) MFCS 2007. LNCS, vol.\u00a04708, pp. 125\u2013134. Springer, Heidelberg (2007)"},{"key":"13_CR41","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"556","DOI":"10.1007\/978-3-642-15155-2_49","volume-title":"Mathematical Foundations of Computer Science 2010","author":"A. Okhotin","year":"2010","unstructured":"Okhotin, A.: Unambiguous Finite Automata over a Unary Alphabet. In: Hlin\u011bn\u00fd, P., Ku\u010dera, A. (eds.) MFCS 2010. LNCS, vol.\u00a06281, pp. 556\u2013567. Springer, Heidelberg (2010)"},{"key":"13_CR42","unstructured":"Okhotin, A.: Unambiguous finite automata over a unary alphabet. Inform. and Computation (to appear)"},{"key":"13_CR43","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1007\/978-3-642-18381-2_36","volume-title":"SOFSEM 2011: Theory and Practice of Computer Science","author":"A. Okhotin","year":"2011","unstructured":"Okhotin, A.: Comparing Linear Conjunctive Languages to Subfamilies of the Context-Free Languages. In: \u010cern\u00e1, I., Gyim\u00f3thy, T., Hromkovi\u010d, J., Jefferey, K., Kr\u00e1lovi\u0107, R., Vukoli\u0107, M., Wolf, S. (eds.) SOFSEM 2011. LNCS, vol.\u00a06543, pp. 431\u2013443. Springer, Heidelberg (2011)"},{"key":"13_CR44","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"414","DOI":"10.1007\/978-3-642-21254-3_33","volume-title":"Language and Automata Theory and Applications","author":"A. Okhotin","year":"2011","unstructured":"Okhotin, A., Salomaa, K.: Descriptional Complexity of Unambiguous Nested Word Automata. In: Dediu, A.-H., Inenaga, S., Mart\u00edn-Vide, C. (eds.) LATA 2011. LNCS, vol.\u00a06638, pp. 414\u2013426. Springer, Heidelberg (2011)"},{"key":"13_CR45","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1007\/978-3-642-22993-0_44","volume-title":"Mathematical Foundations of Computer Science 2011","author":"A. Okhotin","year":"2011","unstructured":"Okhotin, A., Salomaa, K.: State Complexity of Operations on Input-Driven Pushdown Automata. In: Murlak, F., Sankowski, P. (eds.) MFCS 2011. LNCS, vol.\u00a06907, pp. 485\u2013496. Springer, Heidelberg (2011)"},{"key":"13_CR46","doi-asserted-by":"publisher","first-page":"3290","DOI":"10.1016\/j.tcs.2009.05.002","volume":"410","author":"X. Piao","year":"2009","unstructured":"Piao, X., Salomaa, K.: Operational state complexity of nested word automata. Theoret. Comput. Sci.\u00a0410, 3290\u20133302 (2009)","journal-title":"Theoret. Comput. Sci."},{"key":"13_CR47","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1147\/rd.32.0114","volume":"3","author":"M.O. Rabin","year":"1959","unstructured":"Rabin, M.O., Scott, D.: Finite automata and their decision problems. IBM Journal of Research and Development\u00a03, 114\u2013125 (1959)","journal-title":"IBM Journal of Research and Development"},{"key":"13_CR48","doi-asserted-by":"crossref","unstructured":"Rozenberg, G., Salomaa, A. (eds.): Handbook of Formal Languages, vol.\u00a0I\u2013III. Springer (1997)","DOI":"10.1007\/978-3-642-59126-6"},{"key":"13_CR49","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/0020-0190(86)90047-5","volume":"23","author":"W. Rytter","year":"1986","unstructured":"Rytter, W.: An application of Mehlhorn\u2019s algorithm for bracket languages to logn space recognition of input-driven languages. Inform. Process. Lett.\u00a023, 81\u201384 (1986)","journal-title":"Inform. Process. Lett."},{"key":"13_CR50","doi-asserted-by":"publisher","first-page":"580","DOI":"10.1016\/j.ic.2010.11.021","volume":"209","author":"K. Salomaa","year":"2011","unstructured":"Salomaa, K.: Limitations of lower bound methods for deterministic nested word automata. Inform. Comput\u00a0209, 580\u2013589 (2011)","journal-title":"Inform. Comput"},{"key":"13_CR51","doi-asserted-by":"crossref","unstructured":"Schmidt, E.M.: Succinctness of Description of Context-Free, Regular and Unambiguous Languages, Ph. D. thesis. Cornell University (1978)","DOI":"10.7146\/dpb.v7i84.6500"},{"key":"13_CR52","doi-asserted-by":"crossref","unstructured":"Shallit, J.: A Second Course in Formal Languages and Automata Theory. Cambridge University Press (2009)","DOI":"10.1017\/CBO9780511808876"},{"key":"13_CR53","doi-asserted-by":"crossref","unstructured":"Yu, S.: Regular languages. In: [48], vol.\u00a0I, pp. 41\u2013110","DOI":"10.1007\/978-3-642-59136-5_2"},{"key":"13_CR54","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1016\/0304-3975(92)00011-F","volume":"125","author":"S. Yu","year":"1994","unstructured":"Yu, S., Zhuang, Q., Salomaa, K.: The state complexity of some basic operations on regular languages. Theoret. Comput. Sci.\u00a0125, 315\u2013328 (1994)","journal-title":"Theoret. Comput. Sci."}],"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_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T23:16:41Z","timestamp":1556925401000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-31644-9_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642316432","9783642316449"],"references-count":54,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-31644-9_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012]]}}}