{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T17:36:13Z","timestamp":1725730573105},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642387708"},{"type":"electronic","value":"9783642387715"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-38771-5_24","type":"book-chapter","created":{"date-parts":[[2013,6,10]],"date-time":"2013-06-10T02:16:25Z","timestamp":1370830585000},"page":"264-276","source":"Crossref","is-referenced-by-count":0,"title":["Some Decision Questions Concerning the Time Complexity of Language Acceptors"],"prefix":"10.1007","author":[{"given":"Oscar H.","family":"Ibarra","sequence":"first","affiliation":[]},{"given":"Bala","family":"Ravikumar","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"24_CR1","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1016\/S0022-0000(74)80027-9","volume":"8","author":"B. Baker","year":"1974","unstructured":"Baker, B., Book, R.: Reversal-bounded multipushdown machines. J. Comput. Syst. Sci.\u00a08, 315\u2013332 (1974)","journal-title":"J. Comput. Syst. Sci."},{"key":"24_CR2","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/0304-3975(88)90012-6","volume":"23","author":"T. Chan","year":"1983","unstructured":"Chan, T., Ibarra, O.H.: On the finite-valuedness problem for sequential machines. Theor. Comput. Sci.\u00a023, 95\u2013101 (1983)","journal-title":"Theor. Comput. Sci."},{"key":"24_CR3","unstructured":"Cui, C., Dang, Z., Fischer, T.R., Ibarra, O.H.: Similarity in languages and programs (submitted)"},{"key":"24_CR4","doi-asserted-by":"crossref","unstructured":"Chatterjee, K., Doyen, L., Henzinger, T.A.: Quantitative Languages. ACM Transactions on Computational Logic (2010)","DOI":"10.1145\/1805950.1805953"},{"key":"24_CR5","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1145\/321386.321403","volume":"14","author":"S. Ginsburg","year":"1967","unstructured":"Ginsburg, S., Greibach, S.A., Harrison, M.A.: One-way stack automata. J. ACM\u00a014, 389\u2013418 (1967)","journal-title":"J. ACM"},{"issue":"2","key":"24_CR6","first-page":"193","volume":"8","author":"J. Goldstine","year":"2002","unstructured":"Goldstine, J., Kappes, M., Kintala, C.M.R., Leung, H., Malcher, A., Wotschke, D.: Descriptional complexity of machines with limited resources. Journal of Universal Computer Science\u00a08(2), 193\u2013234 (2002)","journal-title":"Journal of Universal Computer Science"},{"key":"24_CR7","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1145\/321250.321254","volume":"12","author":"S.A. Greibach","year":"1965","unstructured":"Greibach, S.A.: A new normal-Form theorem for context-free phrase structure grammars. J. ACM\u00a012, 42\u201352 (1965)","journal-title":"J. ACM"},{"key":"24_CR8","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. Syst. Sci.\u00a022, 220\u2013229 (1981)","journal-title":"J. Comput. Syst. Sci."},{"key":"24_CR9","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/BF01744569","volume":"16","author":"E. Gurari","year":"1983","unstructured":"Gurari, E., Ibarra, O.H.: A note on finite-valued and finitely ambiguous transducers. Math. Systems Theory\u00a016, 61\u201366 (1983)","journal-title":"Math. Systems Theory"},{"key":"24_CR10","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1016\/0304-3975(91)90356-7","volume":"78","author":"T. Harju","year":"1991","unstructured":"Harju, T., Karhumaki, J.: The equivalence problem of multitape finite automata. Theor. Comput. Sci.\u00a078, 347\u2013355 (1991)","journal-title":"Theor. Comput. Sci."},{"key":"24_CR11","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1016\/0022-0000(82)90051-4","volume":"24","author":"K. Hashiguchi","year":"1982","unstructured":"Hashiguchi, K.: Limitedness theorem on finite automata with distance functions. J. Comput. Syst. Sci.\u00a024, 233\u2013244 (1982)","journal-title":"J. Comput. Syst. Sci."},{"key":"24_CR12","unstructured":"Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages and Computation. Addison-Wesley Publishing Company (1979)"},{"key":"24_CR13","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. ACM\u00a025, 116\u2013133 (1978)","journal-title":"J. ACM"},{"key":"24_CR14","doi-asserted-by":"publisher","first-page":"524","DOI":"10.1137\/0207042","volume":"7","author":"O.H. Ibarra","year":"1978","unstructured":"Ibarra, O.H.: The unsolvability of the equivalence problem for \u03b5-free NGSM\u2019s with unary input (output) alphabet and applications. SIAM J. Computing\u00a07, 524\u2013532 (1978)","journal-title":"SIAM J. Computing"},{"key":"24_CR15","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1137\/S0097539792240625","volume":"24","author":"O.H. Ibarra","year":"1995","unstructured":"Ibarra, O.H., Jiang, T., Tran, N.Q., Wang, H.: New decidability results concerning two-way counter machines and applications. SIAM J. Comput.\u00a024, 123\u2013137 (1995)","journal-title":"SIAM J. Comput."},{"key":"24_CR16","doi-asserted-by":"crossref","unstructured":"Kozen, D.: Lower bounds for natural proof systems. In: IEEE Conf. on Foundations of Computer Science, pp. 254\u2013266 (1977)","DOI":"10.1109\/SFCS.1977.16"},{"key":"24_CR17","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1016\/S0304-3975(03)00377-3","volume":"310","author":"H. Leung","year":"2004","unstructured":"Leung, H., Podolskiy, V.: The limitedness problem on distance automata: Hashiguchi\u2019s method revisited. Theor. Comput. Sci.\u00a0310, 147\u2013158 (2004)","journal-title":"Theor. Comput. Sci."},{"key":"24_CR18","doi-asserted-by":"publisher","first-page":"437","DOI":"10.2307\/1970290","volume":"74","author":"M. Minsky","year":"1961","unstructured":"Minsky, M.: Recursive unsolvability of Post\u2019s problem of Tag and other topics in the theory of Turing machines. Ann. of Math.\u00a074, 437\u2013455 (1961)","journal-title":"Ann. of Math."},{"key":"24_CR19","doi-asserted-by":"publisher","first-page":"598","DOI":"10.1137\/0214044","volume":"14","author":"R. Stearns","year":"1985","unstructured":"Stearns, R., Hunt, H.: On the equivalence and containment problems for unambiguous regular expressions, grammars and automata. SIAM Journal on Computing\u00a014, 598\u2013611 (1985)","journal-title":"SIAM Journal on Computing"},{"key":"24_CR20","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1112\/plms\/s2-42.1.230","volume":"42","author":"A.M. Turing","year":"1937","unstructured":"Turing, A.M.: On Computable numbers, with an application to the Entscheidungsproblem. Proc. London Math. Soc., s2\u00a042, 230\u2013265 (1937)","journal-title":"Proc. London Math. Soc., s2"}],"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-642-38771-5_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,14]],"date-time":"2019-05-14T00:25:44Z","timestamp":1557793544000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-38771-5_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642387708","9783642387715"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38771-5_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}