{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:40:32Z","timestamp":1725565232812},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540223931"},{"type":"electronic","value":"9783540278122"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-27812-2_23","type":"book-chapter","created":{"date-parts":[[2010,9,14]],"date-time":"2010-09-14T03:45:36Z","timestamp":1284435936000},"page":"259-267","source":"Crossref","is-referenced-by-count":0,"title":["Structural Equivalence of Regularly Extended E0L Grammars: An Automata Theoretic Proof"],"prefix":"10.1007","author":[{"given":"Kai","family":"Salomaa","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Derick","family":"Wood","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"23_CR1","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/S0304-3975(00)00294-2","volume":"267","author":"J. Albert","year":"2001","unstructured":"Albert, J., Giammarresi, D., Wood, D.: Normal form algorithms for extended context-free grammars. Theoret. Comput. Sci.\u00a0267, 35\u201347 (2001)","journal-title":"Theoret. Comput. Sci."},{"key":"23_CR2","doi-asserted-by":"publisher","first-page":"649","DOI":"10.1007\/s00236-002-0085-4","volume":"38","author":"J. Berstel","year":"2002","unstructured":"Berstel, J., Boasson, L.: Formal properties of XML grammars and languages. Acta Informatica\u00a038, 649\u2013671 (2002)","journal-title":"Acta Informatica"},{"key":"23_CR3","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1162\/109966200750410613","volume":"2","author":"A. Br\u00fcggemann-Klein","year":"2000","unstructured":"Br\u00fcggemann-Klein, A., Wood, D.: Caterpillars: A context-specification technique. Mark-up Languages: Theory & Practice\u00a02, 81\u2013106 (2000)","journal-title":"Mark-up Languages: Theory & Practice"},{"key":"23_CR4","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1142\/S0129054102000959","volume":"13","author":"A. Br\u00fcggemann-Klein","year":"2002","unstructured":"Br\u00fcggemann-Klein, A., Wood, D.: The regularity of two-way nondeterministic tree automata languages. Internat. J. of Foundations of Computer Science\u00a013, 67\u201381 (2002)","journal-title":"Internat. J. of Foundations of Computer Science"},{"key":"23_CR5","unstructured":"Cameron, H.A., Wood, D.: Structural equivalence of regularly extended contextfree grammars and SGML DTDs (manuscript) (1996)"},{"key":"23_CR6","unstructured":"G\u00e9cseg, F., Steinby, M.: Tree Automata, Acad\u00e9miai Kiad\u00f3, Budapest (1984)"},{"key":"23_CR7","first-page":"1","volume-title":"Handbook of Formal Languages","author":"F. G\u00e9cseg","year":"1997","unstructured":"G\u00e9cseg, F., Steinby, M.: Tree languages. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, vol.\u00a0III, pp. 1\u201368. Springer, Heidelberg (1997)"},{"key":"23_CR8","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1016\/S0020-0190(97)00067-7","volume":"62","author":"G. Istrate","year":"1997","unstructured":"Istrate, G.: The strong equivalence of ET0L grammars. Inf. Process. Lett.\u00a062, 171\u2013176 (1997)","journal-title":"Inf. Process. Lett."},{"key":"23_CR9","doi-asserted-by":"crossref","first-page":"490","DOI":"10.1145\/321406.321411","volume":"14","author":"R. McNaughton","year":"1967","unstructured":"McNaughton, R.: Parenthesis grammars. J. Assoc. Comput. Mach.\u00a014, 490\u2013500 (1967)","journal-title":"J. Assoc. Comput. Mach."},{"key":"23_CR10","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1007\/978-3-642-58117-5_7","volume-title":"Lindenmayer Systems: Impacts on Theoretical Computer Science, Computer Graphics, and Developmental Biology","author":"V. Niemi","year":"1992","unstructured":"Niemi, V.: A normal form for structurally equivalent E0L grammars. In: Rozenberg, G., Salomaa, A. (eds.) Lindenmayer Systems: Impacts on Theoretical Computer Science, Computer Graphics, and Developmental Biology, pp. 133\u2013148. Springer, Heidelberg (1992)"},{"key":"23_CR11","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1016\/0166-218X(91)90100-B","volume":"32","author":"T.. Ottmann","year":"1991","unstructured":"Ottmann, T., Wood, D.: Defining families of trees with E0L grammars. Discrete Applied Math.\u00a032, 195\u2013209 (1991)","journal-title":"Discrete Applied Math."},{"key":"23_CR12","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1007\/978-3-642-58117-5_8","volume-title":"Lindenmayer Systems: Impacts on Theoretical Computer Science, Computer Graphics, and Developmental Biology","author":"T.. Ottmann","year":"1992","unstructured":"Ottmann, T., Wood, D.: Simplifications of E0L grammars. In: Rozenberg, G., Salomaa, A. (eds.) Lindenmayer Systems: Impacts on Theoretical Computer Science, Computer Graphics, and Developmental Biology, pp. 149\u2013166. Springer, Heidelberg (1992)"},{"key":"23_CR13","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1016\/S0022-0000(68)80037-6","volume":"2","author":"M. Paull","year":"1968","unstructured":"Paull, M., Unger, S.: Structural equivalence of context-free grammars. J. Comput. System Sci.\u00a02, 427\u2013463 (1968)","journal-title":"J. Comput. System Sci."},{"key":"23_CR14","volume-title":"The Mathematical Theory of L Systems","author":"G. Rozenberg","year":"1980","unstructured":"Rozenberg, G., Salomaa, A.: The Mathematical Theory of L Systems. Academic Press, New York (1980)"},{"key":"23_CR15","doi-asserted-by":"crossref","first-page":"471","DOI":"10.1051\/ita\/1995290604711","volume":"29","author":"K. Salomaa","year":"1995","unstructured":"Salomaa, K., Wood, D., Yu, S.: Complexity of E0L structural equivalence. RAIRO Theoretical Informatics\u00a029, 471\u2013485 (1995)","journal-title":"RAIRO Theoretical Informatics"},{"key":"23_CR16","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/0304-3975(95)00187-5","volume":"164","author":"K. Salomaa","year":"1996","unstructured":"Salomaa, K., Wood, D., Yu, S.: Structural equivalence and ET0L grammars. Theoret. Comput. Sci.\u00a0164, 123\u2013140 (1996)","journal-title":"Theoret. Comput. Sci."},{"key":"23_CR17","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/0304-3975(91)90176-3","volume":"82","author":"K. Salomaa","year":"1991","unstructured":"Salomaa, K., Yu, S.: Decidability of structural equivalence of E0L grammars. Theoret. Comput. Sci.\u00a082, 131\u2013139 (1991)","journal-title":"Theoret. Comput. Sci."},{"key":"23_CR18","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1016\/S0304-3975(01)00197-9","volume":"276","author":"K. Salomaa","year":"2002","unstructured":"Salomaa, K., Yu, S.: Decidability of EDT0L structural equivalence. Theoret. Comput. Sci.\u00a0276, 245\u2013259 (2002)","journal-title":"Theoret. Comput. Sci."},{"key":"23_CR19","first-page":"143","volume-title":"Currents in the Theory of Computing","author":"J.W. Thatcher","year":"1973","unstructured":"Thatcher, J.W.: Tree automata: an informal survey. In: Aho, A.V. (ed.) Currents in the Theory of Computing, pp. 143\u2013172. Prentice Hall, Englewood Cliffs (1973)"},{"key":"23_CR20","volume-title":"Theory of Computation","author":"D. Wood","year":"1987","unstructured":"Wood, D.: Theory of Computation. John Wiley & Sons, New York (1987)"}],"container-title":["Lecture Notes in Computer Science","Theory Is Forever"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-27812-2_23.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T03:27:23Z","timestamp":1620012443000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-27812-2_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540223931","9783540278122"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-27812-2_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}