{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T23:34:39Z","timestamp":1649115279654},"reference-count":5,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1994,3,1]],"date-time":"1994-03-01T00:00:00Z","timestamp":762480000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":7078,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[1994,3]]},"DOI":"10.1016\/0012-365x(94)90252-6","type":"journal-article","created":{"date-parts":[[2003,1,30]],"date-time":"2003-01-30T15:07:37Z","timestamp":1043939257000},"page":"47-65","source":"Crossref","is-referenced-by-count":2,"title":["Classes of finite relations as initial abstract data types \u2013 II"],"prefix":"10.1016","volume":"126","author":[{"given":"Virgil-Emil","family":"C\u01cez\u01cenescu","sequence":"first","affiliation":[]},{"given":"Gheorghe","family":"\u015etef\u01cenescu","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"3","key":"10.1016\/0012-365X(94)90252-6_BIB1","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1016\/0012-365X(91)90147-T","article-title":"Classes of finite relations as initial abstract data types","volume":"90","author":"C\u01cez\u01cenescu","year":"1991","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(94)90252-6_BIB2","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1016\/S0019-9958(67)90670-5","article-title":"Automata in general algebras","volume":"11","author":"Eilenberg","year":"1967","journal-title":"Inform. and Control"},{"key":"10.1016\/0012-365X(94)90252-6_BIB3","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1016\/0021-8693(76)90106-X","article-title":"Matricial theories","volume":"42","author":"Elgot","year":"1976","journal-title":"J. Algebra"},{"key":"10.1016\/0012-365X(94)90252-6_BIB4","doi-asserted-by":"crossref","unstructured":"Y. Lafont, Penrose diagrams and 2-dimensional rewriting, Proc. of LMS Symp. on Applications of Categories in Computer Science, to appear.","DOI":"10.1017\/CBO9780511525902.011"},{"key":"10.1016\/0012-365X(94)90252-6_BIB5","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1016\/0304-3975(87)90114-9","article-title":"On flowchart theories. Part II: the nondeterministic case","volume":"52","author":"\u015etef\u01cenescu","year":"1987","journal-title":"Theoret. Comput. Sci."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X94902526?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X94902526?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,30]],"date-time":"2019-03-30T07:21:10Z","timestamp":1553930470000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X94902526"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,3]]},"references-count":5,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1994,3]]}},"alternative-id":["0012365X94902526"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(94)90252-6","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1994,3]]}}}