{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T08:31:11Z","timestamp":1743150671977,"version":"3.40.3"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031177149"},{"type":"electronic","value":"9783031177156"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-17715-6_22","type":"book-chapter","created":{"date-parts":[[2022,10,2]],"date-time":"2022-10-02T09:02:27Z","timestamp":1664701347000},"page":"342-359","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Active Learning for Deterministic Bottom-Up Nominal Tree Automata"],"prefix":"10.1007","author":[{"given":"Rindo","family":"Nakanishi","sequence":"first","affiliation":[]},{"given":"Yoshiaki","family":"Takata","sequence":"additional","affiliation":[]},{"given":"Hiroyuki","family":"Seki","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,10,3]]},"reference":[{"key":"22_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":"22_CR2","doi-asserted-by":"crossref","unstructured":"Boja\u0144czyk, M., David, C., Muscholl, A., Schwentick, T., Segoufin, L.: Two-variable logic on data words. ACM Trans. Comput. Log. 12(4), 1\u201326, 27 (2011)","DOI":"10.1145\/1970398.1970403"},{"key":"22_CR3","doi-asserted-by":"crossref","unstructured":"Boja\u0144czyk, M., Klin, B., Lasota, S.: Automata theory in nominal sets. Log. Methods Comput. Sci. 10(3:4), 1\u201344 (2014)","DOI":"10.2168\/LMCS-10(3:4)2014"},{"key":"22_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1007\/978-3-642-38771-5_12","volume-title":"Developments in Language Theory","author":"B Bollig","year":"2013","unstructured":"Bollig, B., Habermehl, P., Leucker, M., Monmege, B.: A fresh approach to learning register automata. In: B\u00e9al, M.-P., Carton, O. (eds.) DLT 2013. LNCS, vol. 7907, pp. 118\u2013130. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38771-5_12"},{"issue":"2","key":"22_CR5","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/s00165-016-0355-5","volume":"28","author":"S Cassel","year":"2016","unstructured":"Cassel, S., Howar, F., Jonsson, B., Steffen, B.: Active learning for extended finite state machines. Formal Aspects Comput. 28(2), 233\u2013263 (2016). https:\/\/doi.org\/10.1007\/s00165-016-0355-5","journal-title":"Formal Aspects Comput."},{"key":"22_CR6","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/s002360050120","volume":"35","author":"EYC Cheng","year":"1998","unstructured":"Cheng, E.Y.C., Kaminski, M.: Context-free languages over infinite alphabets. Acta Inform. 35, 245\u2013267 (1998)","journal-title":"Acta Inform."},{"key":"22_CR7","unstructured":"Clarke, E.M., Grumberg, J.O., Kroening, D., Peled, D., Veith, H.: Model Checking, Second. Edition, Chapter 15: Verification with Automata Learning. The MIT Press, Cambridge (2018)"},{"key":"22_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/3-540-36577-X_24","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"JM Cobleigh","year":"2003","unstructured":"Cobleigh, J.M., Giannakopoulou, D., P\u0102s\u0102reanu, C.S.: Learning assumptions for compositional verification. In: Garavel, H., Hatcliff, J. (eds.) TACAS 2003. LNCS, vol. 2619, pp. 331\u2013346. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-36577-X_24"},{"key":"22_CR9","doi-asserted-by":"crossref","unstructured":"Demri, S., Lazi\u0107, R.: LTL with the freeze quantifier and register automata. ACM Trans. Comput. Log. 10(3), 1\u201330, 16 (2009)","DOI":"10.1145\/1507244.1507246"},{"key":"22_CR10","unstructured":"Figueira, D., Segoufin, L.: Bottom-up automata on data trees and vertical XPath. In: 28th Symposium on Theoretical Aspects of Computer Science (STACS 2011), pp. 93\u2013104 (2011)"},{"key":"22_CR11","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1007\/s001650200016","volume":"13","author":"M Gabbay","year":"2002","unstructured":"Gabbay, M., Pitts, A.M.: A new approach to abstract syntax with variable binding. Formal Aspects Comput. 13, 341\u2013363 (2002)","journal-title":"Formal Aspects Comput."},{"key":"22_CR12","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1016\/0304-3975(94)90242-9","volume":"134","author":"M Kaminski","year":"1994","unstructured":"Kaminski, M., Francez, N.: Finite-memory automata. Theor. Comput. Sci. 134, 329\u2013363 (1994)","journal-title":"Theor. Comput. Sci."},{"key":"22_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"386","DOI":"10.1007\/978-3-540-78127-1_21","volume-title":"Pillars of Computer Science","author":"M Kaminski","year":"2008","unstructured":"Kaminski, M., Tan, T.: Tree automata over infinite alphabets. In: Avron, A., Dershowitz, N., Rabinovich, A. (eds.) Pillars of Computer Science. LNCS, vol. 4800, pp. 386\u2013423. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-78127-1_21"},{"key":"22_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/978-3-540-74792-5_6","volume-title":"Formal Methods for Components and Objects","author":"M Leucker","year":"2007","unstructured":"Leucker, M.: Learning meets verification. In: de Boer, F.S., Bonsangue, M.M., Graf, S., de Roever, W.-P. (eds.) FMCO 2006. LNCS, vol. 4709, pp. 127\u2013151. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-74792-5_6"},{"issue":"7","key":"22_CR15","doi-asserted-by":"publisher","first-page":"1278","DOI":"10.1016\/j.jcss.2015.03.005","volume":"81","author":"L Libkin","year":"2015","unstructured":"Libkin, L., Tan, T., Vrgo\u010d, D.: Regular expressions for data words. J. Comput. Syst. Sci. 81(7), 1278\u20131297 (2015)","journal-title":"J. Comput. Syst. Sci."},{"key":"22_CR16","doi-asserted-by":"crossref","unstructured":"Libkin, L., Vrgo\u010d, D.: Regular path queries on graphs with data. In: 15th International Conference on Database Theory (ICDT 2012), pp. 74\u201385","DOI":"10.1145\/2274576.2274585"},{"key":"22_CR17","doi-asserted-by":"crossref","unstructured":"Moerman, J., Sammartino, M., Silva, A., Klin, B., Szynwelski, M.: Learning nominal automata. In: 44th ACM SIGPLAN Symposium on Principles of Programming Languages (POPL 2017), pp. 613\u2013625 (2017)","DOI":"10.1145\/3009837.3009879"},{"key":"22_CR18","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1016\/j.jcss.2017.02.008","volume":"87","author":"AS Murawski","year":"2017","unstructured":"Murawski, A.S., Ramsay, S.J., Tzevelekos, N.: Reachability in pushdown register automata. J. Comput. Syst. Sci. 87, 58\u201383 (2017)","journal-title":"J. Comput. Syst. Sci."},{"key":"22_CR19","doi-asserted-by":"crossref","unstructured":"Nakanishi, R., Takata, Y., Seki, H.: Active learning for deterministic bottom-up nominal tree automata, arXiv preprint arXiv:2208.08319 (2022)","DOI":"10.1007\/978-3-031-17715-6_22"},{"issue":"3","key":"22_CR20","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1145\/1013560.1013562","volume":"5","author":"F Neven","year":"2004","unstructured":"Neven, F., Schwentick, T., Vianu, V.: Finite state machines for strings over infinite alphabets. ACM Trans. Comput. Log. 5(3), 403\u2013435 (2004)","journal-title":"ACM Trans. Comput. Log."},{"key":"22_CR21","series-title":"IFIP Advances in Information and Communication Technology","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/978-0-387-35578-8_13","volume-title":"Formal Methods for Protocol Engineering and Distributed Systems","author":"D Peled","year":"1999","unstructured":"Peled, D., Vardi, M.Y., Yannakakis, M.: Black box checking. In: Wu, J., Chanson, S.T., Gao, Q. (eds.) Formal Methods for Protocol Engineering and Distributed Systems. IAICT, vol. 28, pp. 225\u2013240. Springer, Boston, MA (1999). https:\/\/doi.org\/10.1007\/978-0-387-35578-8_13"},{"key":"22_CR22","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, 223\u2013242 (1990)","journal-title":"Theor. Comput. Sci."},{"key":"22_CR23","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1016\/S0304-3975(99)00105-X","volume":"231","author":"H Sakamoto","year":"2000","unstructured":"Sakamoto, H., Ikeda, D.: Intractability of decision problems for finite-memory automata. Theor. Comput. Sci. 231, 297\u2013308 (2000)","journal-title":"Theor. Comput. Sci."},{"key":"22_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1007\/978-3-030-02508-3_22","volume-title":"Theoretical Aspects of Computing \u2013 ICTAC 2018","author":"R Senda","year":"2018","unstructured":"Senda, R., Takata, Y., Seki, H.: Complexity results on register context-free grammars and register tree automata. In: Fischer, B., Uustalu, T. (eds.) ICTAC 2018. LNCS, vol. 11187, pp. 415\u2013434. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-02508-3_22"},{"key":"22_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"334","DOI":"10.1007\/978-3-030-85315-0_19","volume-title":"Theoretical Aspects of Computing \u2013 ICTAC 2021","author":"R Senda","year":"2021","unstructured":"Senda, R., Takata, Y., Seki, H.: Reactive synthesis from visibly register pushdown automata. In: Cerone, A., \u00d6lveczky, P.C. (eds.) ICTAC 2021. LNCS, vol. 12819, pp. 334\u2013353. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-85315-0_19"}],"container-title":["Lecture Notes in Computer Science","Theoretical Aspects of Computing \u2013 ICTAC 2022"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-17715-6_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,2]],"date-time":"2022-10-02T23:05:13Z","timestamp":1664751913000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-17715-6_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031177149","9783031177156"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-17715-6_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"3 October 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICTAC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Colloquium on Theoretical Aspects of Computing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Tbilisi","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Georgia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 September 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 September 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ictac2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/viam.science.tsu.ge\/clas2022\/ictac\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}