{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T18:07:58Z","timestamp":1743012478311,"version":"3.40.3"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319601335"},{"type":"electronic","value":"9783319601342"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-60134-2_3","type":"book-chapter","created":{"date-parts":[[2017,5,27]],"date-time":"2017-05-27T12:53:09Z","timestamp":1495889589000},"page":"27-39","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["On the Regularity and Learnability of Ordered DAG Languages"],"prefix":"10.1007","author":[{"given":"Henrik","family":"Bj\u00f6rklund","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Johanna","family":"Bj\u00f6rklund","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Petter","family":"Ericson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,5,28]]},"reference":[{"key":"3_CR1","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/0890-5401(87)90052-6","volume":"75","author":"D Angluin","year":"1987","unstructured":"Angluin, D.: Learning regular sets from queries and counterexamples. Inf. Comput. 75, 87\u2013106 (1987)","journal-title":"Inf. Comput."},{"key":"3_CR2","unstructured":"Banarescu, L., Bonial, C., Cai, S., Georgescu, M., Griffitt, K., Hermjakob, U., Knight, K., Koehn, P., Palmer, M., Schneider, N.: Abstract meaning representation for sembanking. In: 7th Linguistic Annotation Workshop & Interoperability with Discourse, Sofia, Bulgaria (2013)"},{"key":"3_CR3","doi-asserted-by":"crossref","unstructured":"Bj\u00f6rklund, H., Bj\u00f6rklund, J., Ericson, P.: On the regularity and learnability of ordered DAG languages. Technical report UMINF 17.12, Ume\u00e5 University (2017)","DOI":"10.1007\/978-3-319-60134-2_3"},{"key":"3_CR4","doi-asserted-by":"crossref","unstructured":"Bj\u00f6rklund, H., Drewes, F., Ericson, P.: Between a rock and a hard place - uniform parsing for hyperedge replacement DAG grammars. In: 10th International Conference on Language and Automata Theory and Applications, Prague, Czech Republic, pp. 521\u2013532 (2016)","DOI":"10.1007\/978-3-319-30000-9_40"},{"key":"3_CR5","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.ic.2015.11.005","volume":"246","author":"J Bj\u00f6rklund","year":"2016","unstructured":"Bj\u00f6rklund, J., Fernau, H., Kasprzik, A.: Polynomial inference of universal automata from membership and equivalence queries. Inf. Comput. 246, 3\u201319 (2016)","journal-title":"Inf. Comput."},{"key":"3_CR6","unstructured":"Chiang, D., Andreas, J., Bauer, D., Hermann, K.M., Jones, B., Knight, K.: Parsing graphs with hyperedge replacement grammars. In: 51st Annual Meeting of the Association for Computational Linguistics (ACL 2013), Sofia, Bulgaria, pp. 924\u2013932 (2013)"},{"issue":"3","key":"3_CR7","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/s00236-011-0135-x","volume":"48","author":"F Drewes","year":"2011","unstructured":"Drewes, F., Bj\u00f6rklund, J., Maletti, A.: MAT learners for tree series: an abstract data type and two realizations. Acta Informatica 48(3), 165 (2011)","journal-title":"Acta Informatica"},{"issue":"2","key":"3_CR8","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/s00224-005-1233-3","volume":"40","author":"F Drewes","year":"2007","unstructured":"Drewes, F., H\u00f6gberg, J.: Query learning of regular tree languages: how to avoid dead states. Theory Comput. Syst. 40(2), 163\u2013185 (2007)","journal-title":"Theory Comput. Syst."},{"key":"3_CR9","doi-asserted-by":"crossref","unstructured":"Drewes, F., Kreowski, H.-J., Habel, A.: Hyperedge replacement graph grammars. In: Rozenberg, G. (ed.), Handbook of Graph Grammars, vol. 1, pp. 95\u2013162. World Scientific (1997)","DOI":"10.1142\/9789812384720_0002"},{"issue":"3","key":"3_CR10","first-page":"332","volume":"12","author":"F Drewes","year":"2007","unstructured":"Drewes, F., Vogler, H.: Learning deterministically recognizable tree series. J. Automata, Lang. Comb 12(3), 332\u2013354 (2007)","journal-title":"J. Automata, Lang. Comb"},{"key":"3_CR11","doi-asserted-by":"crossref","unstructured":"Hara, S., Shoudai, T.: Polynomial time MAT learning of c-deterministic regular formal graph systems. In: International Conference on Advanced Applied Informatics (IIAI AAI 2014), Kitakyushu, Japan, pp. 204\u2013211 (2014)","DOI":"10.1109\/IIAI-AAI.2014.51"},{"issue":"02","key":"3_CR12","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1017\/S1351324911000064","volume":"17","author":"J H\u00f6gberg","year":"2011","unstructured":"H\u00f6gberg, J.: A randomised inference algorithm for regular tree languages. Nat. Lang. Eng. 17(02), 203\u2013219 (2011)","journal-title":"Nat. Lang. Eng."},{"key":"3_CR13","first-page":"170","volume":"47","author":"D Kozen","year":"1992","unstructured":"Kozen, D.: On the Myhill-Nerode theorem for trees. Bull. EATCS 47, 170\u2013173 (1992)","journal-title":"Bull. EATCS"},{"key":"3_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1007\/978-3-540-75414-5_14","volume-title":"Algebraic Informatics","author":"A Maletti","year":"2007","unstructured":"Maletti, A.: Learning deterministically recognizable tree series \u2014 revisited. In: Bozapalidis, S., Rahonis, G. (eds.) CAI 2007. LNCS, vol. 4728, pp. 218\u2013235. Springer, Heidelberg (2007). doi:10.1007\/978-3-540-75414-5_14"},{"key":"3_CR15","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1007\/978-3-540-75225-7_25","volume-title":"Algorithmic Learning Theory","author":"R Okada","year":"2007","unstructured":"Okada, R., Matsumoto, S., Uchida, T., Suzuki, Y., Shoudai, T.: Exact learning of finite unions of graph patterns from queries. In: Hutter, M., Servedio, R.A., Takimoto, E. (eds.) ALT 2007. LNCS (LNAI), vol. 4754, pp. 298\u2013312. Springer, Heidelberg (2007). doi:10.1007\/978-3-540-75225-7_25"},{"issue":"1\u20133","key":"3_CR16","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1016\/S0019-9958(86)80045-6","volume":"69","author":"G Rozenberg","year":"1986","unstructured":"Rozenberg, G., Welzl, E.: Boundary NLC graph grammars-basic definitions, normal forms, and complexity. Inf. Control 69(1\u20133), 136\u2013167 (1986)","journal-title":"Inf. Control"},{"issue":"2\u20133","key":"3_CR17","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1016\/0304-3975(90)90017-C","volume":"76","author":"Y Sakakibara","year":"1990","unstructured":"Sakakibara, Y.: Learning context-free grammars from structural data in polynomial time. Theor. Comput. Sci. 76(2\u20133), 223\u2013242 (1990)","journal-title":"Theor. Comput. Sci."},{"key":"3_CR18","first-page":"380","volume":"34","author":"H Shirakawa","year":"1993","unstructured":"Shirakawa, H., Yokomori, T.: Polynomial-time MAT learning of c-deterministic context-free grammars. Trans. Inf. Process. Soc. Jpn. 34, 380\u2013390 (1993)","journal-title":"Trans. Inf. Process. Soc. Jpn."}],"container-title":["Lecture Notes in Computer Science","Implementation and Application of Automata"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-60134-2_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T15:30:52Z","timestamp":1710343852000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-60134-2_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319601335","9783319601342"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-60134-2_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"28 May 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CIAA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Implementation and Application of Automata","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Marne-la-Vall\u00e9e","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 June 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 June 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wia2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/ciaa17.univ-mlv.fr\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}