{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T14:14:23Z","timestamp":1725891263492},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540643005"},{"type":"electronic","value":"9783540697206"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/bfb0053554","type":"book-chapter","created":{"date-parts":[[2006,6,7]],"date-time":"2006-06-07T01:19:46Z","timestamp":1149643186000},"page":"243-257","source":"Crossref","is-referenced-by-count":8,"title":["The Church-Rosser languages are the deterministic variants of the growing context-sensitive languages"],"prefix":"10.1007","author":[{"given":"Gundula","family":"Niemann","sequence":"first","affiliation":[]},{"given":"Friedrich","family":"Otto","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2006,5,23]]},"reference":[{"key":"17_CR1","volume-title":"PhD thesis","author":"R.V. Book","year":"1969","unstructured":"R.V. Book. Grammars with Time Functions. PhD thesis, Harvard University, Cambridge, Massachusetts, February 1969."},{"key":"17_CR2","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1145\/322290.322301","volume":"29","author":"R.V. Book","year":"1982","unstructured":"R.V. Book. Confluent and other types of Thue systems. J. Association Computing Machinery, 29:171\u2013182, 1982.","journal-title":"J. Association Computing Machinery"},{"key":"17_CR3","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4613-9771-7","volume-title":"String-Rewriting Systems","author":"R.V. Book","year":"1993","unstructured":"R.V. Book and F. Otto.String-Rewriting Systems. Springer-Verlag, New York, 1993."},{"key":"17_CR4","unstructured":"G. Buntrock. Wachsende kontext-sensitive Sprachen. Habilitationsschrift, Fakult\u00e4t f\u00fcr Mathematik und Informatik, Universit\u00e4t W\u00fcrzburg, July 1996."},{"key":"17_CR5","first-page":"77","volume-title":"Lecture Notes in Computer Science 623","author":"G. Buntrock","year":"1992","unstructured":"G. Buntrock and K. Lory\u015a. On growing context-sensitive languages. In W. Kuich, editor, Proc. of 19th ICALP, Lecture Notes in Computer Science 623, pages 77\u201388. Springer-Verlag, Berlin, 1992."},{"key":"17_CR6","first-page":"595","volume-title":"Lecture Notes in Computer Science 775","author":"G. Buntrock","year":"1994","unstructured":"G. Buntrock and K. Lory\u015a. The variable membership problem: Succinctness versus complexity. In P. Enjalbert, E.W. Mayr, and K.W. Wagner, editors, Proc. of 11th STACS, Lecture Notes in Computer Science 775, pages 595\u2013606. Springer-Verlag, Berlin, 1994."},{"key":"17_CR7","first-page":"313","volume-title":"Lecture Notes in Computer Science 900","author":"G. Buntrock","year":"1995","unstructured":"G. Buntrock and F. Otto. Growing context-sensitive languages and Church-Rosser languages.In E.W. Mayr and C. Puech, editors, Proc. of 12th STACS, Lecture Notes in Computer Science 900, pages 313\u2013324. Springer-Verlag, Berlin, 1995."},{"key":"17_CR8","doi-asserted-by":"publisher","first-page":"456","DOI":"10.1016\/0022-0000(86)90062-0","volume":"33","author":"E. Dahlhaus","year":"1986","unstructured":"E. Dahlhaus and M. Warmuth. Membership for growing context-sensitive grammars is polynomial. J. Computer System Sciences, 33:456\u2013472, 1986.","journal-title":"J. Computer System Sciences"},{"key":"17_CR9","first-page":"29","volume":"3","author":"A.W. Gladkij","year":"1964","unstructured":"A.W. Gladkij. On the complexity of derivations for context-sensitive grammars. Algebri i Logika Sem., 3:29\u201344, 1964. In Russian.","journal-title":"Algebri i Logika Sem."},{"key":"17_CR10","volume-title":"Introduction to Automata Theory, Languages, and Computation","author":"J.E. Hopcroft","year":"1979","unstructured":"J.E. Hopcroft and J.D. Ullman. Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading, M.A., 1979."},{"key":"17_CR11","doi-asserted-by":"crossref","first-page":"324","DOI":"10.1145\/42282.42284","volume":"35","author":"R. McNaughton","year":"1988","unstructured":"R. McNaughton, P. Narendran, and F. Otto. Church-Rosser Thue systems and formal languages. J. Association Computing Machinery, 35:324\u2013344, 1988.","journal-title":"J. Association Computing Machinery"},{"key":"17_CR12","series-title":"Lecture Notes in Computer Science 1232","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1007\/3-540-62950-5_61","volume-title":"Rewriting Techniques and Applications","author":"F. Otto","year":"1997","unstructured":"F. Otto, M. Katsura, and Y. Kobayashi. Cross-sections for finitely presented monoids with decidable word problems. In H. Comon, editor, Rewriting Techniques and Applications, Lecture Notes in Computer Science 1232, pages 53\u201367. Springer-Verlag, Berlin, 1997."}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Science and Computation Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0053554","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,10]],"date-time":"2019-02-10T17:08:53Z","timestamp":1549818533000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0053554"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540643005","9783540697206"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/bfb0053554","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1998]]}}}