{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T10:16:54Z","timestamp":1742379414813,"version":"3.30.2"},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1989,11,1]],"date-time":"1989-11-01T00:00:00Z","timestamp":625881600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Acta Informatica"],"published-print":{"date-parts":[[1989,11]]},"DOI":"10.1007\/bf00265153","type":"journal-article","created":{"date-parts":[[2004,10,3]],"date-time":"2004-10-03T05:48:10Z","timestamp":1096782490000},"page":"179-191","source":"Crossref","is-referenced-by-count":5,"title":["HDTOL matching of computations of multitape automata"],"prefix":"10.1007","volume":"27","author":[{"suffix":"II","given":"Karel","family":"Culik","sequence":"first","affiliation":[]},{"given":"Juhani","family":"Karhum\u00e4ki","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"BF00265153_CR1","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-663-09367-1","volume-title":"Transductions and Context-Free Languages","author":"J. Berstel","year":"1979","unstructured":"Berstel, J.: Transductions and Context-Free Languages. Stuttgart: Teubner 1979"},{"key":"BF00265153_CR2","doi-asserted-by":"crossref","first-page":"218","DOI":"10.1016\/S0022-0000(73)80045-5","volume":"7","author":"M. Bird","year":"1973","unstructured":"Bird, M.: The equivalence problem for deterministic two-tape automata. J. Comput. Syst. Sci. 7, 218\u2013236 (1973)","journal-title":"J. Comput. Syst. Sci."},{"key":"BF00265153_CR3","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1016\/0304-3975(86)90134-9","volume":"47","author":"K. Culik II","year":"1986","unstructured":"Culik II, K., Karhum\u00e4ki, J.: The equivalence of finite valued transducers (on HDTOL languages) is decidable. Theor. Comput. Sci. 47, 71\u201384 (1986)","journal-title":"Theor. Comput. Sci."},{"key":"BF00265153_CR4","unstructured":"Culik II, K., Karhum\u00e4ki, J.: Loops in automata and HDTOL relations. RAIRO, Inf. Th\u00e9or. Appl. (to appear)"},{"key":"BF00265153_CR5","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1016\/0022-0000(78)90002-8","volume":"17","author":"K. Culik II","year":"1978","unstructured":"Culik II, K., Salomaa, A.: On the decidability of morphic equivalence for languages. J. Comput. Syst. Sci. 17, 163\u2013175 (1978)","journal-title":"J. Comput. Syst. Sci."},{"key":"BF00265153_CR6","volume-title":"The Mathematical Theory of Context-Free Languages","author":"S. Ginsburg","year":"1966","unstructured":"Ginsburg, S.: The Mathematical Theory of Context-Free Languages. New York: McGraw Hill 1966"},{"key":"BF00265153_CR7","volume-title":"Introduction to Formal Language Theory","author":"M. Harrison","year":"1978","unstructured":"Harrison, M.: Introduction to Formal Language Theory. Reading: Addison-Wesley 1978"},{"key":"BF00265153_CR8","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(83)90077-4","volume":"26","author":"E. Kinber","year":"1983","unstructured":"Kinber, E.: The inclusion problem for some classes of deterministic multitape automata. Theor. Comput. Sci. 26, 1\u201324 (1983)","journal-title":"Theor. Comput. Sci."},{"key":"BF00265153_CR9","doi-asserted-by":"crossref","unstructured":"Lewis, H.R.: A new decidability problem with applications. Proceedings of 18th FOCS Conference, pp. 62\u201373 (1979)","DOI":"10.1109\/SFCS.1977.2"},{"key":"BF00265153_CR10","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1147\/rd.32.0114","volume":"3","author":"M. Rabin","year":"1959","unstructured":"Rabin, M., Scott, D.: Finite automata and their decision problems. IBM J. Res. Dev. 3, 114\u2013125 (1959)","journal-title":"IBM J. Res. Dev."},{"key":"BF00265153_CR11","volume-title":"The Mathematical Theory of L Systems","author":"G. Rozenberg","year":"1980","unstructured":"Rozenberg, G., Salomaa, A.: The Mathematical Theory of L Systems. New York: Academic Press 1980"},{"key":"BF00265153_CR12","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1016\/S0019-9958(74)90839-0","volume":"25","author":"L.G. Valiant","year":"1974","unstructured":"Valiant, L.G.: The equivalence problem for deterministic finite-turn pushdown automata. Inf. Control 25, 123\u2013133 (1974)","journal-title":"Inf. Control"}],"container-title":["Acta Informatica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00265153.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF00265153\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00265153","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00265153.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,18]],"date-time":"2024-12-18T20:58:10Z","timestamp":1734555490000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF00265153"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,11]]},"references-count":12,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1989,11]]}},"alternative-id":["BF00265153"],"URL":"https:\/\/doi.org\/10.1007\/bf00265153","relation":{},"ISSN":["0001-5903","1432-0525"],"issn-type":[{"type":"print","value":"0001-5903"},{"type":"electronic","value":"1432-0525"}],"subject":[],"published":{"date-parts":[[1989,11]]}}}