{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T06:55:11Z","timestamp":1725692111500},"publisher-location":"Berlin, Heidelberg","reference-count":38,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642316432"},{"type":"electronic","value":"9783642316449"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-31644-9_5","type":"book-chapter","created":{"date-parts":[[2012,7,19]],"date-time":"2012-07-19T02:17:08Z","timestamp":1342664228000},"page":"75-85","source":"Crossref","is-referenced-by-count":2,"title":["Cooperating Distributed Tree Automata"],"prefix":"10.1007","author":[{"given":"Henning","family":"Fernau","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"5_CR1","first-page":"185","volume-title":"Proceedings of Third Conference on Theoretical Issues in Natural Language Processing (TINLAP-3)","author":"D.E. Appelt","year":"1987","unstructured":"Appelt, D.E.: Bidirectional grammars and the design of natural language generation systems. In: Proceedings of Third Conference on Theoretical Issues in Natural Language Processing (TINLAP-3), January 7-9, pp. 185\u2013191. New Mexico State University, Las Cruces (1987)"},{"key":"5_CR2","doi-asserted-by":"crossref","unstructured":"Asveld, P.R.J., Hogendorp, J.A.: On the generating power of regularly controlled bidirectional grammars. International Journal of Computer Mathematics 40 (1991)","DOI":"10.1080\/00207169108804003"},{"key":"5_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1007\/978-3-642-20000-7_7","volume-title":"Computation, Cooperation, and Life","author":"M.H. Beek ter","year":"2011","unstructured":"ter Beek, M.H., Csuhaj-Varj\u00fa, E., Holzer, M., Vaszil, G.: Cooperating Distributed Grammar Systems: Components with Nonincreasing Competence. In: Kelemen, J., Kelemenov\u00e1, A. (eds.) Computation, Cooperation, and Life. LNCS, vol.\u00a06610, pp. 70\u201389. Springer, Heidelberg (2011)"},{"key":"5_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1007\/978-3-642-14455-4_7","volume-title":"Developments in Language Theory","author":"S. Bensch","year":"2010","unstructured":"Bensch, S., Bj\u00f6rklund, H., Drewes, F.: Algorithmic Properties of Millstream Systems. In: Gao, Y., Lu, H., Seki, S., Yu, S. (eds.) DLT 2010. LNCS, vol.\u00a06224, pp. 54\u201365. Springer, Heidelberg (2010)"},{"key":"5_CR5","unstructured":"Bensch, S., Drewes, F.: Millstream systems \u2014 a formal model for linking language modules by interfaces. In: Workshop on Applications of Tree Automata in Natural Language Systems, pp. 28\u201336. Association for Computational Linguistics ACL (2010)"},{"key":"5_CR6","first-page":"347","volume":"12","author":"H. Bordihn","year":"1996","unstructured":"Bordihn, H., Csuhaj-Varj\u00fa, E.: On competence and completeness in CD grammar systems. Acta Cybernetica\u00a012, 347\u2013360 (1996)","journal-title":"Acta Cybernetica"},{"key":"5_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1080\/00207169408804310","volume":"53","author":"H. Bordihn","year":"1994","unstructured":"Bordihn, H., Fernau, H.: Accepting grammars with regulation. International Journal of Computer Mathematics\u00a053, 1\u201318 (1994)","journal-title":"International Journal of Computer Mathematics"},{"issue":"2","key":"5_CR8","first-page":"97","volume":"1","author":"H. Bordihn","year":"1996","unstructured":"Bordihn, H., Fernau, H.: Accepting grammars and systems via context condition grammars. Journal of Automata, Languages and Combinatorics\u00a01(2), 97\u2013112 (1996)","journal-title":"Journal of Automata, Languages and Combinatorics"},{"key":"5_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"616","DOI":"10.1007\/BFb0055812","volume-title":"Mathematical Foundations of Computer Science 1998","author":"B. Courcelle","year":"1998","unstructured":"Courcelle, B., Lapoire, D.: Facial Circuits of Planar Graphs and Context-Free Languages. In: Brim, L., Gruska, J., Zlatu\u0161ka, J. (eds.) MFCS 1998. LNCS, vol.\u00a01450, pp. 616\u2013624. Springer, Heidelberg (1998)"},{"issue":"1\/2","key":"5_CR10","first-page":"49","volume":"26","author":"E. Csuhaj-Varj\u00fa","year":"1990","unstructured":"Csuhaj-Varj\u00fa, E., Dassow, J.: On cooperating\/distributed grammar systems. J. Inf. Process. Cybern. EIK (formerly Elektron. Inf.verarb. Kybern.)\u00a026(1\/2), 49\u201363 (1990)","journal-title":"J. Inf. Process. Cybern. EIK (formerly Elektron. Inf.verarb. Kybern.)"},{"key":"5_CR11","volume-title":"Grammar Systems: A Grammatical Approach to Distribution and Cooperation","author":"E. Csuhaj-Varj\u00fa","year":"1994","unstructured":"Csuhaj-Varj\u00fa, E., Dassow, J., Kelemen, J., P\u0103un, G.: Grammar Systems: A Grammatical Approach to Distribution and Cooperation. Gordon and Breach, London (1994)"},{"issue":"4","key":"5_CR12","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1142\/S0129054110007428","volume":"21","author":"E. Csuhaj-Varj\u00fa","year":"2010","unstructured":"Csuhaj-Varj\u00fa, E., Dassow, J., Vaszil, G.: Variants of competence-based derivations in cd grammar systems. International Journal of Foundations of Computer Science\u00a021(4), 549\u2013569 (2010)","journal-title":"International Journal of Foundations of Computer Science"},{"key":"5_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1007\/3-540-45007-6_17","volume-title":"Developments in Language Theory","author":"E. Csuhaj-Varj\u00fa","year":"2003","unstructured":"Csuhaj-Varj\u00fa, E., Mitrana, V., Vaszil, G.: Distributed Pushdown Automata Systems: Computational Power. In: \u00c9sik, Z., F\u00fcl\u00f6p, Z. (eds.) DLT 2003. LNCS, vol.\u00a02710, pp. 218\u2013229. Springer, Heidelberg (2003)"},{"issue":"3","key":"5_CR14","first-page":"293","volume":"76","author":"J. Dassow","year":"2007","unstructured":"Dassow, J.: On cooperating distributed grammar systems with competence based start and stop conditions. Fundamenta Informaticae\u00a076(3), 293\u2013304 (2007)","journal-title":"Fundamenta Informaticae"},{"key":"5_CR15","unstructured":"Dassow, J., Mitrana, V.: Cooperating distributed push-down automata. Tech. rep., Universit\u00e4t Magdeburg, Fakult\u00e4t f\u00fcr Informatik (1996)"},{"issue":"3","key":"5_CR16","doi-asserted-by":"publisher","first-page":"611","DOI":"10.1006\/jcss.1998.1610","volume":"58","author":"J. Dassow","year":"1999","unstructured":"Dassow, J., Mitrana, V.: Stack cooperation in multistack pushdown automata. Journal of Computer and System Sciences\u00a058(3), 611\u2013621 (1999)","journal-title":"Journal of Computer and System Sciences"},{"issue":"2","key":"5_CR17","first-page":"83","volume":"18","author":"J. Dassow","year":"1993","unstructured":"Dassow, J., P\u0103un, G., Vicolov, S.: On the power of cooperating\/distributed grammar systems with regular components. Foundations of Computing and Decision Sciences\u00a018(2), 83\u2013108 (1993)","journal-title":"Foundations of Computing and Decision Sciences"},{"issue":"5","key":"5_CR18","doi-asserted-by":"publisher","first-page":"406","DOI":"10.1016\/S0022-0000(70)80041-1","volume":"4","author":"J. Doner","year":"1970","unstructured":"Doner, J.: Tree acceptors and some of their applications. Journal of Computer and System Sciences\u00a04(5), 406\u2013451 (1970)","journal-title":"Journal of Computer and System Sciences"},{"issue":"1-2","key":"5_CR19","first-page":"47","volume":"82","author":"F. Drewes","year":"2008","unstructured":"Drewes, F., van der Merwe, B.: Path languages of random permitting context tree grammars are regular. Fundamenta Informaticae\u00a082(1-2), 47\u201360 (2008)","journal-title":"Fundamenta Informaticae"},{"key":"5_CR20","first-page":"11","volume":"34","author":"F. Drewes","year":"2005","unstructured":"Drewes, F., du Toit, C., Ewert, S., van der Merwe, B., van der Walt, A.P.J.: Random context tree grammars and tree transducers. South African Computer Journal\u00a034, 11\u201325 (2005)","journal-title":"South African Computer Journal"},{"issue":"4","key":"5_CR21","first-page":"459","volume":"86","author":"F. Drewes","year":"2008","unstructured":"Drewes, F., du Toit, C., Ewert, S., van der Merwe, B., van der Walt, A.P.J.: Bag context tree grammars. Fundamenta Informaticae\u00a086(4), 459\u2013480 (2008)","journal-title":"Fundamenta Informaticae"},{"key":"5_CR22","doi-asserted-by":"publisher","first-page":"633","DOI":"10.1016\/S0304-3975(02)00541-8","volume":"299","author":"H. Fernau","year":"2003","unstructured":"Fernau, H., Freund, R., Holzer, M.: Hybrid modes in cooperating distributed grammar systems: combining the t-mode with the modes \u2264\u2009k and =\u2009k. Theoretical Computer Science\u00a0299, 633\u2013662 (2003)","journal-title":"Theoretical Computer Science"},{"key":"5_CR23","first-page":"361","volume":"12","author":"H. Fernau","year":"1996","unstructured":"Fernau, H., Holzer, M.: Accepting multi-agent systems II. Acta Cybernetica\u00a012, 361\u2013379 (1996)","journal-title":"Acta Cybernetica"},{"key":"5_CR24","unstructured":"Fernau, H., Holzer, M.: Bidirectional cooperating distributed grammar systems. Publicationes Mathematicae, Debrecen 54(supplement), 787\u2013806 (1999)"},{"issue":"2-3","key":"5_CR25","first-page":"123","volume":"15","author":"H. Fernau","year":"1996","unstructured":"Fernau, H., Holzer, M., Bordihn, H.: Accepting multi-agent systems: the case of cooperating distributed grammar systems. Computers and Artificial Intelligence\u00a015(2-3), 123\u2013139 (1996)","journal-title":"Computers and Artificial Intelligence"},{"issue":"1-2","key":"5_CR26","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1016\/S0304-3975(00)00022-0","volume":"259","author":"H. Fernau","year":"2001","unstructured":"Fernau, H., Holzer, M., Freund, R.: Hybrid modes in cooperating distributed grammar systems: internal versus external hybridization. Theoretical Computer Science\u00a0259(1-2), 405\u2013426 (2001)","journal-title":"Theoretical Computer Science"},{"key":"5_CR27","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1080\/00207168908803717","volume":"27","author":"J.A. Hogendorp","year":"1989","unstructured":"Hogendorp, J.A.: Controlled bidirectional grammars. International Journal of Computer Mathematics\u00a027, 159\u2013180 (1989)","journal-title":"International Journal of Computer Mathematics"},{"key":"5_CR28","first-page":"98","volume-title":"Post-proceedings of the 7th International Workshop on Finite-State Methods and Natural Language Processing","author":"A. Kasprzik","year":"2009","unstructured":"Kasprzik, A.: Making finite-state methods applicable to languages beyond context-freeness via multi-dimensional trees. In: Piskorski, J., Watson, B., Yli-Jyr\u00e4, A. (eds.) Post-proceedings of the 7th International Workshop on Finite-State Methods and Natural Language Processing, pp. 98\u2013109. IOS Press, Amsterdam (2009)"},{"issue":"3","key":"5_CR29","doi-asserted-by":"publisher","first-page":"362","DOI":"10.1016\/j.jcss.2006.10.005","volume":"73","author":"W. Martens","year":"2007","unstructured":"Martens, W., Neven, F.: Frontiers of tractability for typechecking simple XML transformations. Journal of Computer and System Sciences\u00a073(3), 362\u2013390 (2007)","journal-title":"Journal of Computer and System Sciences"},{"issue":"7","key":"5_CR30","doi-asserted-by":"publisher","first-page":"806","DOI":"10.1016\/j.ic.2008.01.002","volume":"206","author":"W. Martens","year":"2008","unstructured":"Martens, W., Neven, F., Gyssens, M.: Typechecking top-down XML transformations: Fixed input or output schemas. Information and Computation\u00a0206(7), 806\u2013827 (2008)","journal-title":"Information and Computation"},{"key":"5_CR31","first-page":"80","volume":"61","author":"V. Mihalache","year":"1997","unstructured":"Mihalache, V.: Accepting cooperating distributed grammar systems with terminal derivation. EATCS Bulletin\u00a061, 80\u201384 (1997)","journal-title":"EATCS Bulletin"},{"issue":"1","key":"5_CR32","first-page":"83","volume":"12","author":"V. Mitrana","year":"1993","unstructured":"Mitrana, V.: Hybrid cooperating\/distributed grammar systems. Computers and Artificial Intelligence\u00a012(1), 83\u201388 (1993)","journal-title":"Computers and Artificial Intelligence"},{"key":"5_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1007\/3-540-45793-3_2","volume-title":"Computer Science Logic","author":"F. Neven","year":"2002","unstructured":"Neven, F.: Automata, Logic, and XML. In: Bradfield, J. (ed.) CSL 2002. LNCS, vol.\u00a02471, pp. 2\u201326. Springer, Heidelberg (2002)"},{"issue":"4","key":"5_CR34","first-page":"231","volume":"30","author":"G. P\u0103un","year":"1994","unstructured":"P\u0103un, G.: On the generative capacity of hybrid CD grammar systems. J. Inf. Process. Cybern. EIK (formerly Elektron. Inf.verarb. Kybern.)\u00a030(4), 231\u2013244 (1994)","journal-title":"J. Inf. Process. Cybern. EIK (formerly Elektron. Inf.verarb. Kybern.)"},{"key":"5_CR35","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1023\/A:1024695608419","volume":"1","author":"J. Rogers","year":"2003","unstructured":"Rogers, J.: Syntactic structures as multi-dimensional trees. Research on Language & Computation\u00a01, 265\u2013305 (2003)","journal-title":"Research on Language & Computation"},{"volume-title":"Handbook of Formal Languages","year":"1997","key":"5_CR36","unstructured":"Rozenberg, G., Salomaa, A. (eds.): Handbook of Formal Languages, vol.\u00a0III. Springer, Berlin (1997)"},{"key":"5_CR37","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1016\/S0022-0000(67)80022-9","volume":"1","author":"J.W. Thatcher","year":"1967","unstructured":"Thatcher, J.W.: Characterizing derivation trees of context-free grammars through a generalization of finite automata theory. Journal of Computer and System Sciences\u00a01, 317\u2013322 (1967)","journal-title":"Journal of Computer and System Sciences"},{"key":"5_CR38","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1016\/0304-3975(92)90124-X","volume":"104","author":"D.J. Weir","year":"1992","unstructured":"Weir, D.J.: A geometric hierarchy beyond context-free languages. Theoretical Computer Science\u00a0104, 235\u2013261 (1992)","journal-title":"Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","Languages Alive"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-31644-9_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,4]],"date-time":"2019-05-04T03:20:06Z","timestamp":1556940006000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-31644-9_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642316432","9783642316449"],"references-count":38,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-31644-9_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}