{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:48:19Z","timestamp":1725662899421},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540073895"},{"type":"electronic","value":"9783540375852"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1975]]},"DOI":"10.1007\/3-540-07389-2_213","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T15:55:16Z","timestamp":1330185316000},"page":"308-314","source":"Crossref","is-referenced-by-count":0,"title":["On the analysis and synthesis problems for context-free expressions"],"prefix":"10.1007","author":[{"given":"O.","family":"Mayer","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,21]]},"reference":[{"key":"36_CR1","first-page":"331","volume":"12","author":"M. A. Arbib","year":"1968","unstructured":"ARBIB, M.A and GIV'ON, Y. (1968): Algebra Automata I: Parallel Programming as a Prolegomena to a Categorical Approach, IC 12, 331\u2013345.","journal-title":"IC"},{"key":"36_CR2","first-page":"406","volume":"4","author":"J. Doner","year":"1970","unstructured":"DONER, J. (1970): Tree Acceptors and Some of Their Applications, JCSS 4, 406\u2013451.","journal-title":"JCSS"},{"key":"36_CR3","first-page":"353","volume":"5","author":"J. Gruska","year":"1971","unstructured":"GRUSKA, J. (1971): A Characterization of Context-Free Languages, JCSS 5, 353\u2013364.","journal-title":"JCSS"},{"key":"36_CR4","doi-asserted-by":"crossref","unstructured":"KLEENE, S.C. (1956): Representation of events in nerve sets, in \"Automata Studies\", pp. 3\u201340, Princeton Univ. Press.","DOI":"10.1515\/9781400882618-002"},{"key":"36_CR5","unstructured":"MAGIDOR, M. and MORAN, G. (1969): Finite Automata over Finite Trees, Hebrew Univ. Jerusalem, Techn. Rep. No. 30"},{"key":"36_CR6","first-page":"629","volume":"5","author":"I. P. McWhirter","year":"1971","unstructured":"McWHIRTER, I.P. (1971): Substitution Expressions, JCSS 5, 629\u2013637.","journal-title":"JCSS"},{"key":"36_CR7","first-page":"317","volume":"1","author":"J. W. Thatcher","year":"1967","unstructured":"THATCHER, J.W. (1967): Characterizing derivation trees of context-free grammars through a generalization of finite automata theory, JCSS 1, 317\u2013322.","journal-title":"JCSS"},{"key":"36_CR8","first-page":"57","volume":"2","author":"J. W. Thatcher","year":"1969","unstructured":"THATCHER, J.W. and WRIGHT, J.B. (1969): Generalized Finite Automata Theory with an Application to a Decision Problem of Second-Order Logic, MST 2, 57\u201381.","journal-title":"MST"},{"key":"36_CR9","first-page":"311","volume":"18","author":"M,K Yntema","year":"1971","unstructured":"YNTEMA, M,K, (1971): Cap Expressions for Context-Free Languages, IC 18, 311\u2013318","journal-title":"IC"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1975 4th Symposium, Mari\u00e1nsk\u00e9 L\u00e1zn\u011b, September 1\u20135, 1975"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-07389-2_213.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T19:57:25Z","timestamp":1605643045000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-07389-2_213"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1975]]},"ISBN":["9783540073895","9783540375852"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/3-540-07389-2_213","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1975]]}}}