{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:00:47Z","timestamp":1725663647945},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540565031"},{"type":"electronic","value":"9783540475743"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/3-540-56503-5_59","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T11:16:59Z","timestamp":1330255019000},"page":"595-606","source":"Crossref","is-referenced-by-count":2,"title":["A polynomial time algorithm for the equivalence of two morphisms on \u03c9-regular languages"],"prefix":"10.1007","author":[{"given":"Stefano","family":"Varricchio","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,27]]},"reference":[{"key":"59_CR1","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1016\/0304-3975(85)90066-0","volume":"41","author":"M. H. Albert","year":"1985","unstructured":"M.H. Albert and J. Lawrence, A proof of Ehrenfeucht's conjecture, Theoretical Computer Science, 41 (1985) 121\u2013123.","journal-title":"Theoretical Computer Science"},{"key":"59_CR2","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1002\/malq.19600060105","volume":"6","author":"J. R. B\u00fcchi","year":"1960","unstructured":"J.R. B\u00fcchi, Weak second-order arithmetic and finite automata, Z. Math. Logik und Grundl. Math., 6 (1960) 66\u201392.","journal-title":"Z. Math. Logik und Grundl. Math."},{"key":"59_CR3","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1016\/S0019-9958(81)90444-7","volume":"49","author":"K. Culik II","year":"1981","unstructured":"K. Culik II and J. K. Pachl, Equivalence problems for mappings on infinite strings, Information and Control, 49 (1981) 52\u201363.","journal-title":"Information and Control"},{"key":"59_CR4","unstructured":"Eilenberg, S., Automata, Languages and Machines, Vol A, Academic Press 1974."},{"key":"59_CR5","unstructured":"Lothaire, M., Combinatorics on words, Cambridge University Press, 1982."},{"key":"59_CR6","doi-asserted-by":"crossref","unstructured":"J. Karhumaki, W. Rytter and S. Jarominek, Efficient constructions of test sets for regular and context-free languages, preprint 1990.","DOI":"10.1007\/3-540-54345-7_68"},{"key":"59_CR7","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/0020-0190(88)90035-X","volume":"29","author":"A. Luca de","year":"1988","unstructured":"A. de Luca, M. Pelagalli, S. Varricchio, Test set for languages of infinite words, Information Processing Letters, 29 (1988) 91\u201395.","journal-title":"Information Processing Letters"}],"container-title":["Lecture Notes in Computer Science","STACS 93"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-56503-5_59.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:04:29Z","timestamp":1605647069000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-56503-5_59"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540565031","9783540475743"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/3-540-56503-5_59","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1993]]}}}