{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:52:09Z","timestamp":1725663129550},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540078548"},{"type":"electronic","value":"9783540381693"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1976]]},"DOI":"10.1007\/3-540-07854-1_163","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T16:15:25Z","timestamp":1330186525000},"page":"81-98","source":"Crossref","is-referenced-by-count":2,"title":["On the branching structure of languages"],"prefix":"10.1007","author":[{"given":"Ivan M.","family":"Havel","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,21]]},"reference":[{"key":"7_CR1","series-title":"Lecture Notes in Computer Science","first-page":"1","volume-title":"Automata Theory and Formal Languages, Proc. 2nd GI Conf.","author":"R. V. Book","year":"1975","unstructured":"Book, R. V., Formal language theory and theoretical computer science. In: Automata Theory and Formal Languages, Proc. 2nd GI Conf., Lecture Notes in Computer Science 33, Springer Verlag, Berlin 1975, pp. 1\u201315."},{"key":"7_CR2","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1016\/0004-3702(76)90002-3","volume":"7","author":"O. \u0160t\u011bp\u00e1nkov\u00e1","year":"1976","unstructured":"\u0160t\u011bp\u00e1nkov\u00e1, O. and Havel, I. M., A logical theory of robot problem solving. Artificial Intelligence 7 (1976), 165\u2013197.","journal-title":"Artificial Intelligence"},{"key":"7_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1007\/3-540-07162-8_667","volume-title":"Mathematical Foundations of Computer Science","author":"I. M. Havel","year":"1975","unstructured":"Havel, I. M., Finite branching automata: automata theory motivated by problem solving. In: Mathematical Foundations of Computer Science (A. Blikle, Ed.) Lecture Notes in Computer Science 28, Springer-Verlag, Berlin 1975, pp. 53\u201361."},{"key":"7_CR4","unstructured":"Marcus, S., Algebraic Linguistics: Analytical Models, New York 1967."},{"key":"7_CR5","unstructured":"Benda V. and Bendov\u00e1, K., On specific features of recognizable families of languages. This volume"},{"key":"7_CR6","first-page":"281","volume":"10","author":"I. M. Havel","year":"1974","unstructured":"Havel, I. M., Finite branching automata. Kybernetika 10 (1974), pp. 281\u2013302.","journal-title":"Kybernetika"},{"key":"7_CR7","doi-asserted-by":"crossref","unstructured":"Bodnar\u010duk, V. G., Metri\u010deskoe prostranstvo sobytij I. \/The metric space of events I.\/ Kibernetika \/Kiev\/, (1965) No. 1, pp. 24\u201327 \/In Russian\/.","DOI":"10.1007\/BF01071439"},{"volume-title":"Foundations of Modern Analysis","year":"1960","author":"J. Dieudonn\u00e9","key":"7_CR8","unstructured":"Dieudonn\u00e9, J., Foundations of Modern Analysis, Academic Press, New York 1960."},{"key":"7_CR9","unstructured":"Havel, I. M., Nondeterministic finite branching automata. Res. Report 623\/75 Institute of Information Theory and Automation \u010cSAV, August 1975."},{"key":"7_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"252","DOI":"10.1007\/3-540-07389-2_204","volume-title":"Mathematical Foundations of Computer Science 1975","author":"I. M. Havel","year":"1975","unstructured":"Havel, I. M., Nondeterministically recognizable sets of languages. In: Mathematical Foundations of Computer Science 1975 (J. Be\u010dv\u00e1\u0159, Ed.) Lecture Notes in Computer Science 32, Springer-Verlag, Berlin 1975, pp. 252\u2013257."},{"key":"7_CR11","unstructured":"Benda, V. and Bendov\u00e1, K., Recognizable filters and ideals. Commentationes Math. Univ. Carolinae 17 (1976), to appear."},{"key":"7_CR12","unstructured":"Benda, V. and Bendov\u00e1, K., On families recognizable by finite branching automata. \/Manuscript\/."}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1976"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-07854-1_163.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T19:58:30Z","timestamp":1605643110000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-07854-1_163"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1976]]},"ISBN":["9783540078548","9783540381693"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-07854-1_163","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1976]]}}}