{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:17:32Z","timestamp":1760203052255},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642392733"},{"type":"electronic","value":"9783642392740"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-39274-0_18","type":"book-chapter","created":{"date-parts":[[2013,7,11]],"date-time":"2013-07-11T01:07:42Z","timestamp":1373504862000},"page":"193-207","source":"Crossref","is-referenced-by-count":0,"title":["Some Decision Problems Concerning NPDAs, Palindromes, and Dyck Languages"],"prefix":"10.1007","author":[{"given":"Oscar H.","family":"Ibarra","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bala","family":"Ravikumar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"18_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/978-3-642-02737-6_8","volume-title":"Developments in Language Theory","author":"A. Bertoni","year":"2009","unstructured":"Bertoni, A., Choffrut, C., Radicioni, R.: The inclusion problem of context-free languages: some tractable cases. In: Diekert, V., Nowotka, D. (eds.) DLT 2009. LNCS, vol.\u00a05583, pp. 103\u2013112. Springer, Heidelberg (2009)"},{"key":"18_CR2","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-9771-7","volume-title":"String Rewriting Systems","author":"R. Book","year":"1993","unstructured":"Book, R., Otto, F.: String Rewriting Systems. Springer, New York (1993)"},{"key":"18_CR3","doi-asserted-by":"crossref","unstructured":"Durbin, R.: Biological Sequence Analysis: Probabilistic Models of Proteins and Nucleic Acids. Cambridge University Press (1998)","DOI":"10.1017\/CBO9780511790492"},{"key":"18_CR4","doi-asserted-by":"crossref","first-page":"429","DOI":"10.1137\/0304034","volume":"4","author":"S. Ginsburg","year":"1966","unstructured":"Ginsburg, S., Spanier, E.: Finite-turn pushdown automata. SIAM J. on Control\u00a04, 429\u2013453 (1966)","journal-title":"SIAM J. on Control"},{"key":"18_CR5","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1145\/321495.321503","volume":"16","author":"S.A. Greibach","year":"1969","unstructured":"Greibach, S.A.: An infinite hierarchy of context-free languages. J. Assoc. Comput. Mach.\u00a016, 91\u2013106 (1969)","journal-title":"J. Assoc. Comput. Mach."},{"key":"18_CR6","doi-asserted-by":"publisher","first-page":"675","DOI":"10.1145\/322217.322224","volume":"27","author":"S.A. Greibach","year":"1980","unstructured":"Greibach, S.A., Friedman, E.P.: Superdeterministic PDAs: a subcase with a decidable inclusion problem. J. Assoc. Comput. Mach.\u00a027, 675\u2013700 (1980)","journal-title":"J. Assoc. Comput. Mach."},{"key":"18_CR7","doi-asserted-by":"publisher","first-page":"220","DOI":"10.1016\/0022-0000(81)90028-3","volume":"22","author":"E. Gurari","year":"1981","unstructured":"Gurari, E., Ibarra, O.H.: The complexity of decision problems for finite-turn multicounter machines. J. Comput. System Sci.\u00a022, 220\u2013229 (1981)","journal-title":"J. Comput. System Sci."},{"key":"18_CR8","unstructured":"Harrison, M.A.: Introduction to Formal Languages. Addison-Wesley (1978)"},{"key":"18_CR9","unstructured":"Hopcroft, J.E., Motwani, R., Ullman, J.D.: Introduction to Automata Theory, Languages and Computation, 3rd edn. Addison-Wesley (2006)"},{"key":"18_CR10","doi-asserted-by":"crossref","unstructured":"Hunt, H.B., Rosenkrantz, D.J.: Computational parallels between the regular and context-free languages. In: Symp. on Theory of Computing, pp. 64\u201374 (1974)","DOI":"10.1145\/800119.803885"},{"key":"18_CR11","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1145\/322047.322058","volume":"25","author":"O.H. Ibarra","year":"1978","unstructured":"Ibarra, O.H.: Reversal-bounded multicounter machines and their decision problems. J. Assoc. Comput. Mach.\u00a025, 116\u2013133 (1978)","journal-title":"J. Assoc. Comput. Mach."},{"key":"18_CR12","unstructured":"Ibarra, O.H., Ravikumar, B.: On sparseness and ambiguity for acceptors and transducers. In: Monien, B., Vidal-Naquet, G. (eds.) STACS 1986. LNCS, vol.\u00a0210, pp. 171\u2013179. Springer, Heidelberg (1986)"},{"key":"18_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1007\/978-3-642-37064-9_32","volume-title":"Language and Automata Theory and Applications","author":"O.H. Ibarra","year":"2013","unstructured":"Ibarra, O.H., Ravikumar, B.: On bounded languages and reversal-bounded automata. In: Dediu, A.-H., Mart\u00edn-Vide, C., Truthe, B. (eds.) LATA 2013. LNCS, vol.\u00a07810, pp. 359\u2013370. Springer, Heidelberg (2013)"},{"key":"18_CR14","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/j.tcs.2011.12.034","volume":"429","author":"O.H. Ibarra","year":"2012","unstructured":"Ibarra, O.H., Yen, H.-C.: On the containment and equivalence problems for two-way transducers. TCS\u00a0429, 155\u2013163 (2012)","journal-title":"TCS"},{"issue":"5","key":"18_CR15","doi-asserted-by":"publisher","first-page":"1210","DOI":"10.1137\/S0097539704445950","volume":"35","author":"M. Lohrey","year":"2006","unstructured":"Lohrey, M.: Word problems and membership problems on compressed words. SIAM Journal on Computing\u00a035(5), 1210\u20131240 (2006)","journal-title":"SIAM Journal on Computing"},{"key":"18_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1007\/978-3-540-73208-2_30","volume-title":"Developments in Language Theory","author":"A. Malcher","year":"2007","unstructured":"Malcher, A., Pighizzini, G.: Descriptional complexity of bounded context-free languages. In: Harju, T., Karhum\u00e4ki, J., Lepist\u00f6, A. (eds.) DLT 2007. LNCS, vol.\u00a04588, pp. 312\u2013323. Springer, Heidelberg (2007)"},{"key":"18_CR17","doi-asserted-by":"crossref","unstructured":"Minsky, M.: Recursive unsolvability of Post\u2019s problem of Tag and other topics in the theory of Turing machines. Ann. of Math.\u00a0(74), 437\u2013455 (1961)","DOI":"10.2307\/1970290"},{"issue":"1","key":"18_CR18","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1016\/S0304-3975(99)00106-1","volume":"231","author":"G. S\u00e9nizergues","year":"2000","unstructured":"S\u00e9nizergues, G.: Complete formal systems for equivalence problems. Theoret. Comput. Sci.\u00a0231(1), 309\u2013334 (2000)","journal-title":"Theoret. Comput. Sci."},{"key":"18_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"821","DOI":"10.1007\/3-540-45465-9_70","volume-title":"Automata, Languages and Programming","author":"C. Stirling","year":"2002","unstructured":"Stirling, C.: Deciding DPDA equivalence is primitive recursive. In: Widmayer, P., Triguero, F., Morales, R., Hennessy, M., Eidenbenz, S., Conejo, R. (eds.) ICALP 2002. LNCS, vol.\u00a02380, pp. 821\u2013832. Springer, Heidelberg (2002)"}],"container-title":["Lecture Notes in Computer Science","Implementation and Application of Automata"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-39274-0_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,15]],"date-time":"2019-05-15T18:34:55Z","timestamp":1557945295000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-39274-0_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642392733","9783642392740"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-39274-0_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}