{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:55:57Z","timestamp":1725663357326},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540129202"},{"type":"electronic","value":"9783540388050"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1984]]},"DOI":"10.1007\/3-540-12920-0_22","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T17:58:46Z","timestamp":1330192726000},"page":"241-249","source":"Crossref","is-referenced-by-count":2,"title":["Adherence equivalence is decidable for DOL languages"],"prefix":"10.1007","author":[{"given":"Tom","family":"Head","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,29]]},"reference":[{"key":"22_CR1","volume-title":"Formal Language Theory","author":"J. Beauquier","year":"1980","unstructured":"J. Beauquier and M. Nivat, Application of formal language theory to problems of security and synchronization, in: R.V. Book, Ed., Formal Language Theory (Academic Press, New York, 1980)."},{"key":"22_CR2","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1016\/0022-0000(80)90010-0","volume":"20","author":"L. Boasson","year":"1980","unstructured":"L. Boasson and M. Nivat, Adherences of languages, J. Computer and System Sciences 20(1980)285\u2013309.","journal-title":"J. Computer and System Sciences"},{"key":"22_CR3","unstructured":"K.Culik II and T.Harju, The \u03c9-sequence equivalence problem for DOL systems is decidable, J. Assoc. Computing Machinery, to appear; see also: Proc. 13th ACM Symposium on the Theory of Computing (1981)1\u20136."},{"key":"22_CR4","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/0304-3975(82)90013-5","volume":"19","author":"K. Culik II","year":"1982","unstructured":"K. Culik II and A. Salomaa, On infinite words obtained by iterating morphisms, Theor. Computer Science 19(1982)29\u201338.","journal-title":"Theor. Computer Science"},{"key":"22_CR5","unstructured":"T.Head, Adherences of DOL Languages, Theor. Computer Science, to appear in 1984."},{"key":"22_CR6","volume-title":"Developmental Systems and Languages","author":"G. T. Herman","year":"1975","unstructured":"G.T. Herman and G. Rosenberg, Developmental Systems and Languages (North Holland\/American Elsevier, New York, 1975)."},{"key":"22_CR7","volume-title":"The Mathematical Theory of L Systems","author":"G. Rozenberg","year":"1980","unstructured":"G. Rozenberg and A. Salomaa, The Mathematical Theory of L Systems (Academic Press, New York, 1980)."}],"container-title":["Lecture Notes in Computer Science","STACS 84"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-12920-0_22.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T20:52:09Z","timestamp":1619556729000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-12920-0_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1984]]},"ISBN":["9783540129202","9783540388050"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/3-540-12920-0_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1984]]}}}