{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:23:29Z","timestamp":1725665009126},"publisher-location":"Berlin, Heidelberg","reference-count":3,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540628446"},{"type":"electronic","value":"9783540687030"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/3-540-62844-4_30","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T22:51:01Z","timestamp":1330296661000},"page":"422-429","source":"Crossref","is-referenced-by-count":0,"title":["The structure of the basic morphisms"],"prefix":"10.1007","author":[{"given":"Virgil Emil","family":"C\u0103z\u0103nescu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,3]]},"reference":[{"key":"30_CR1","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1016\/0012-365X(91)90147-T","volume":"90","author":"V. E. C\u0103z\u0103nescu","year":"1991","unstructured":"V. E. C\u0103z\u0103nescu, Gh. \u015etef\u0103nescu, Classes of finite relations as initial abstract data types I, Discrete mathematics 90 (1991), 233\u2013265.","journal-title":"Discrete mathematics"},{"key":"30_CR2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(92)90171-B","volume":"99","author":"V. E. C\u0103z\u0103nescu","year":"1992","unstructured":"V. E. C\u0103z\u0103nescu, Gh. \u015etef\u0103nescu, A general result on abstract flowchart schemes with applications to the study of accesibilty, reduction and minimization Theoretical Computer Science 99 (1992), 1\u201363.","journal-title":"Theoretical Computer Science"},{"key":"30_CR3","doi-asserted-by":"crossref","first-page":"171","DOI":"10.3233\/FI-1990-13204","volume":"13","author":"V. E. C\u0103z\u0103nescu","year":"1990","unstructured":"V. E. C\u0103z\u0103nescu, Gh. \u015etef\u0103nescu, Towards a new algebraic foundation of flowchart scheme theory, Fundamenta Informaticae 13 (1990), 171\u2013210.","journal-title":"Fundamenta Informaticae"}],"container-title":["Lecture Notes in Computer Science","New Trends in Formal Languages"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-62844-4_30.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,31]],"date-time":"2021-12-31T11:23:22Z","timestamp":1640949802000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-62844-4_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540628446","9783540687030"],"references-count":3,"URL":"https:\/\/doi.org\/10.1007\/3-540-62844-4_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]}}}