{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T23:41:03Z","timestamp":1725579663765},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642320231"},{"type":"electronic","value":"9783642320248"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-32024-8_7","type":"book-chapter","created":{"date-parts":[[2012,7,14]],"date-time":"2012-07-14T03:58:00Z","timestamp":1342238280000},"page":"97-113","source":"Crossref","is-referenced-by-count":2,"title":["Reference-Set Constraints as Linear Tree Transductions via Controlled Optimality Systems"],"prefix":"10.1007","author":[{"given":"Thomas","family":"Graf","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"7_CR1","volume-title":"The Minimalist Program","author":"N. Chomsky","year":"1995","unstructured":"Chomsky, N.: The Minimalist Program. MIT Press, Cambridge (1995)"},{"key":"7_CR2","first-page":"307","volume":"24","author":"R. Frank","year":"1998","unstructured":"Frank, R., Satta, G.: Optimality theory and the generative complexity of constraint violability. Computational Linguistics\u00a024, 307\u2013315 (1998)","journal-title":"Computational Linguistics"},{"key":"7_CR3","volume-title":"Tree Automata","author":"F. G\u00e9cseg","year":"1984","unstructured":"G\u00e9cseg, F., Steinby, M.: Tree Automata. Academei Kaido, Budapest (1984)"},{"key":"7_CR4","volume-title":"Local Constraints vs","author":"D. Johnson","year":"1999","unstructured":"Johnson, D., Lappin, S.: Local Constraints vs. Economy. CSLI, Stanford (1999)"},{"key":"7_CR5","first-page":"299","volume-title":"More than Words. A Festschrift for Dieter Wunderlich","author":"G. J\u00e4ger","year":"2002","unstructured":"J\u00e4ger, G.: Gradient constraints in finite state OT: The unidirectional and the bidirectional case. In: Kaufmann, I., Stiebels, B. (eds.) More than Words. A Festschrift for Dieter Wunderlich, pp. 299\u2013325. Akademie Verlag, Berlin (2002)"},{"key":"7_CR6","doi-asserted-by":"crossref","unstructured":"Karttunen, L.: The proper treatment of optimality in computational phonology (1998); manuscript, Xerox Research Center Europe","DOI":"10.3115\/1611533.1611534"},{"key":"7_CR7","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1016\/j.tcs.2005.11.024","volume":"354","author":"S. Kepser","year":"2006","unstructured":"Kepser, S., M\u00f6nnich, U.: Closure properties of linear context-free tree languages with an application to optimality theory. Theoretical Computer Science\u00a0354, 82\u201397 (2006)","journal-title":"Theoretical Computer Science"},{"key":"7_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1007\/978-3-642-14322-9_13","volume-title":"The Mathematics of Language","author":"G.M. Kobele","year":"2010","unstructured":"Kobele, G.M.: Without Remnant Movement, mGs are Context-Free. In: Ebert, C., J\u00e4ger, G., Michaelis, J. (eds.) MOL 10. LNCS, vol.\u00a06149, pp. 160\u2013173. Springer, Heidelberg (2010)"},{"key":"#cr-split#-7_CR9.1","doi-asserted-by":"crossref","unstructured":"Kobele, G.M., Retor\u00e9, C., Salvati, S.: An automata-theoretic approach to minimalism. In: Rogers, J., Kepser, S. (eds.) Model Theoretic Syntax at 10, pp. 71-80 (2007)","DOI":"10.1111\/j.1467-9612.2007.00094.x"},{"key":"#cr-split#-7_CR9.2","unstructured":"Workshop Organized as Part of the Europen Summer School on Logic, Language and Information (ESSLLI 2007), Dublin, Ireland, August 6-17 (2007)"},{"key":"7_CR10","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/3846.001.0001","volume-title":"Interface Strategies: Optimal and Costly Computations","author":"T. Reinhart","year":"2006","unstructured":"Reinhart, T.: Interface Strategies: Optimal and Costly Computations. MIT Press, Cambridge (2006)"},{"key":"7_CR11","volume-title":"A Descriptive Approach to Language-Theoretic Complexity","author":"J. Rogers","year":"1998","unstructured":"Rogers, J.: A Descriptive Approach to Language-Theoretic Complexity. CSLI, Stanford (1998)"},{"key":"7_CR12","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1016\/S0304-3975(01)00351-6","volume":"293","author":"E.P. Stabler","year":"2003","unstructured":"Stabler, E.P., Keenan, E.: Structural similarity. Theoretical Computer Science\u00a0293, 345\u2013363 (2003)","journal-title":"Theoretical Computer Science"},{"key":"7_CR13","first-page":"64","volume-title":"Studies in Optimality Theory","author":"C. Wartena","year":"2000","unstructured":"Wartena, C.: A note on the complexity of optimality systems. In: Blutner, R., J\u00e4ger, G. (eds.) Studies in Optimality Theory, pp. 64\u201372. University of Potsdam, Potsdam (2000)"}],"container-title":["Lecture Notes in Computer Science","Formal Grammar"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-32024-8_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,30]],"date-time":"2019-06-30T19:18:02Z","timestamp":1561922282000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-32024-8_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642320231","9783642320248"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-32024-8_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}