{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:46:41Z","timestamp":1725662801688},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540083535"},{"type":"electronic","value":"9783540372851"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1977]]},"DOI":"10.1007\/3-540-08353-7_129","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T16:26:05Z","timestamp":1330187165000},"page":"78-92","source":"Crossref","is-referenced-by-count":0,"title":["Algebra and logic in theoretical computer science"],"prefix":"10.1007","author":[{"given":"Ferenc","family":"G\u00e9cseg","sequence":"first","affiliation":[]},{"given":"E.-T\u00f3th","family":"P\u00e9ter","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,24]]},"reference":[{"key":"7_CR1","doi-asserted-by":"publisher","first-page":"484","DOI":"10.1016\/S0019-9958(68)90917-0","volume":"13","author":"W. S. Brainerd","year":"1968","unstructured":"Brainerd, W.S., The minimization of tree automata. Information and Control, 13(1968) 484\u2013491.","journal-title":"Information and Control"},{"key":"7_CR2","first-page":"37","volume":"3","author":"P. D\u00f6m\u00f6si","year":"1976","unstructured":"D\u00f6m\u00f6si, P., On minimal R-complete systems of finite automata. Acta Cybernetica, 3(1976) 37\u201341.","journal-title":"Acta Cybernetica"},{"key":"7_CR3","unstructured":"Ecsedi-T\u00f3th, P., Horn logic and its applications. Doctoral Dissertation, Rolando E\u00f6tv\u00f6s University, Budapest, 1976 (in Hungarian)."},{"key":"7_CR4","first-page":"217","volume":"1","author":"F. Ferenci","year":"1976","unstructured":"Ferenci, F., A new representation of context-free languages by tree automata. Foundations of Control Engineering, 1(1976) 217\u2013222.","journal-title":"Foundations of Control Engineering"},{"key":"7_CR5","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1090\/psapm\/019\/0235771","volume":"19","author":"R. W. Floyd","year":"1967","unstructured":"Floyd, R.W., Assigning meaning to programs. In: Proc. of a Symposium in Applied Mathematics 19 (J. T. Schwartz, Ed.), pp. 19\u201332, 1967. Amer. Math. Soc.","journal-title":"Proc. of a Symposium in Applied Mathematics"},{"key":"7_CR6","first-page":"351","volume":"14","author":"F. G\u00e9cseg","year":"1974","unstructured":"G\u00e9cseg, F., Composition of automata. Proceedings of the 2nd Colloquium on Automata, Languages and Programming, 1974, Springer Lecture Notes in Computer Science, Vol. 14, 351\u2013363.","journal-title":"Proceedings of the 2nd Colloquium on Automata, Languages and Programming"},{"key":"7_CR7","first-page":"285","volume":"2","author":"F. G\u00e9cseg","year":"1976","unstructured":"G\u00e9cseg, F., Representation of automaton mappings in finite length. Acta Cybernetica, 2(1976) 285\u2013289.","journal-title":"Acta Cybernetica"},{"key":"7_CR8","first-page":"21","volume":"38","author":"F. G\u00e9cseg","year":"1976","unstructured":"G\u00e9cseg, F., On products of abstract automata. Acta Sci. Math., 38(1976) 21\u201343.","journal-title":"Acta Sci. Math."},{"key":"7_CR9","first-page":"161","volume":"1","author":"F. G\u00e9cseg","year":"1976","unstructured":"G\u00e9cseg, F. and Horv\u00e1th, Gy., On representation of trees and context-free languages by tree automata. Foundations of Control Engineering, 1(1976) 161\u2013168.","journal-title":"Foundations of Control Engineering"},{"key":"7_CR10","first-page":"3","volume":"16","author":"V. M. Gluskov","year":"1961","unstructured":"Gluskov, V.M., Abstract theory of Automata. (Russian), Uspechi Matem. Nauk, 16(1961) 3\u201362.","journal-title":"Uspechi Matem. Nauk"},{"key":"7_CR11","unstructured":"Gr\u00e4tzer, G., Universal Algebras, D. Van Nostrand Company, Princeton, New Yersey, 1968."},{"key":"7_CR12","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/S0019-9958(62)90193-6","volume":"5","author":"J. Hartmanis","year":"1962","unstructured":"Hartmanis, J., Loop-free structure of sequential machines. Information and Control, 5(1962) 25\u201344.","journal-title":"Information and Control"},{"issue":"R3","key":"7_CR13","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1051\/ita\/197408R300051","volume":"8","author":"G. Longo","year":"1974","unstructured":"Longo, G. and Venturini Zilli, M., Complexity of theorem proving procedures: some general properties. Rev. Francaise Automat. Informat. Recherche Operationelle Ser. Rouge 8, no. R-3.","journal-title":"Revue fran\u00e7aise d'automatique informatique recherche op\u00e9rationnelle. Informatique th\u00e9orique"},{"key":"7_CR14","volume-title":"Universal Algebras, Colloquia Mathematica J\u00e1nos Bolyai Societatis","author":"M. Steinby","year":"1977","unstructured":"Steinby, M., On algebras as tree automata. Universal Algebras, Colloquia Mathematica J\u00e1nos Bolyai Societatis, North Holland Publishing Company, Amsterdam, 1977 (to appear)."}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1977"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-08353-7_129.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T20:52:06Z","timestamp":1619556726000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-08353-7_129"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1977]]},"ISBN":["9783540083535","9783540372851"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-08353-7_129","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1977]]}}}