{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:53:16Z","timestamp":1725558796420},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540405436"},{"type":"electronic","value":"9783540450771"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-45077-1_33","type":"book-chapter","created":{"date-parts":[[2010,6,25]],"date-time":"2010-06-25T20:53:34Z","timestamp":1277499214000},"page":"355-363","source":"Crossref","is-referenced-by-count":3,"title":["Languages Defined by Generalized Equality Sets"],"prefix":"10.1007","author":[{"given":"Vesa","family":"Halava","sequence":"first","affiliation":[]},{"given":"Tero","family":"Harju","sequence":"additional","affiliation":[]},{"given":"Hendrik Jan","family":"Hoogeboom","sequence":"additional","affiliation":[]},{"given":"Michel","family":"Latteux","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"33_CR1","volume-title":"Algebraic and Automata-theoretic Properties of Formal Languages","author":"S. Ginsburg","year":"1975","unstructured":"Ginsburg, S.: Algebraic and Automata-theoretic Properties of Formal Languages. North-Holland, Amsterdam (1975)"},{"doi-asserted-by":"crossref","unstructured":"Halava, V., Harju, T., Hoogeboom, H.J., Latteux, M.: Valence Languages Generated by Generalized Equality Sets, Tech. Report 502, Turku Centre for Computer Science (August 2002) (submitted)","key":"33_CR2","DOI":"10.1007\/978-3-540-45077-1_33"},{"doi-asserted-by":"crossref","unstructured":"Harju, T., Karhum\u00e4ki, J.: Morphisms. Handbook of Formal Languages. In: Rozenberg, G., Salomaa, A. (eds.), vol.\u00a01, Springer, Heidelberg (1997)","key":"33_CR3","DOI":"10.1007\/978-3-642-59136-5_7"},{"key":"33_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"420","DOI":"10.1007\/BFb0036926","volume-title":"Automata, Languages and Programming","author":"H. Latteux","year":"1983","unstructured":"Latteux, H., Leguy, J.: On the composition of morphisms and inverse morphisms. In: D\u00edaz, J. (ed.) ICALP 1983. LNCS, vol.\u00a0154, pp. 420\u2013432. Springer, Heidelberg (1983)"},{"key":"33_CR5","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/BF01699459","volume":"18","author":"H. Latteux","year":"1985","unstructured":"Latteux, H., Leguy, J.: On Usefulness of Bifaithful Rational cones. Math. Systems Theory\u00a018, 19\u201332 (1985)","journal-title":"Math. Systems Theory"},{"key":"33_CR6","first-page":"911","volume":"6","author":"G. P\u0103un","year":"1980","unstructured":"P\u0103un, G.: A new generative device: valence grammars, Revue Roumaine de Math. Pures et Appliqu\u00e9es\u00a06, 911\u2013924 (1980)","journal-title":"Pures et Appliqu\u00e9es"},{"key":"33_CR7","volume-title":"Formal Languages","author":"A. Salomaa","year":"1973","unstructured":"Salomaa, A.: Formal Languages. Academic Press, New York (1973)"}],"container-title":["Lecture Notes in Computer Science","Fundamentals of Computation Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-45077-1_33","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T12:53:12Z","timestamp":1559220792000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-45077-1_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540405436","9783540450771"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-45077-1_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}