{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T17:01:25Z","timestamp":1725642085382},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540061274"},{"type":"electronic","value":"9783642807329"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1973]]},"DOI":"10.1007\/978-3-642-80732-9_11","type":"book-chapter","created":{"date-parts":[[2011,12,12]],"date-time":"2011-12-12T19:08:54Z","timestamp":1323716934000},"page":"107-115","source":"Crossref","is-referenced-by-count":2,"title":["Programmschemata mit Booleschen Unterprogrammen"],"prefix":"10.1007","author":[{"given":"K.","family":"Indermark","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"11_CR1","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1016\/S0019-9958(66)80003-7","volume":"9","author":"PC Fischer","year":"1966","unstructured":"Fischer, P.C. : Turing machines with restricted memory access. Inf. and Control 9 (1966), 364 \u2013 379","journal-title":"Inf. and Control"},{"key":"11_CR2","series-title":"Mitteilungen der GMD Bonn Nr","volume-title":"Programmschemata und Familien Abstrakter Programme","author":"FW Henke","year":"1971","unstructured":"v. Henke, F.W. : Programmschemata und Familien Abstrakter Programme. Mitteilungen der GMD Bonn Nr. 11 (1971)"},{"key":"11_CR3","first-page":"85","volume-title":"Some formalproperties of a class of non-deterministic program schemata","author":"R Ito","year":"1968","unstructured":"Ito, R. : Some formal properties of a class of non-deterministic program schemata. IEEE Conf. Rec. IX SWAT (1968), 85 \u2013 98"},{"key":"11_CR4","doi-asserted-by":"publisher","first-page":"220","DOI":"10.1016\/S0022-0000(70)80022-8","volume":"4","author":"D Luckham","year":"1970","unstructured":"Luckham, D., Park, D. and Paterson, M. : On formalised computer programs. Journal of Comp.Syst.Sc. 4 (1970), 220 \u2013 249","journal-title":"Journal of Comp.Syst.Sc."},{"key":"11_CR5","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1016\/S0022-0000(67)80014-X","volume":"1","author":"D Scott","year":"1967","unstructured":"Scott, D. : Some definitional suggestions for automata theory. Journal of Comp.Syst.Sc. 1 (1967), 187 \u2013 212","journal-title":"Journal of Comp.Syst.Sc."},{"key":"11_CR6","unstructured":"Scott, D. : Outline of a mathematical theory of computation. Oxford University Comp. Lab., Techn. Monograph PRG-2 (1970)"},{"key":"11_CR7","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1016\/S0022-0000(71)80036-3","volume":"5","author":"H Strong","year":"1971","unstructured":"Strong, H. : Translating recursion equations into flow charts. Journal of Comp.Syst.Sc. 5 (1971), 254 \u2013 285","journal-title":"Journal of Comp.Syst.Sc."}],"container-title":["Lecture Notes in Economics and Mathematical Systems","GI. Gesellschaft f\u00fcr Informatik e.V. 2. Jahrestagung"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-80732-9_11.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,26]],"date-time":"2020-11-26T18:21:15Z","timestamp":1606414875000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-80732-9_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1973]]},"ISBN":["9783540061274","9783642807329"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-80732-9_11","relation":{},"ISSN":["0075-8442"],"issn-type":[{"type":"print","value":"0075-8442"}],"subject":[],"published":{"date-parts":[[1973]]}}}