{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:37:08Z","timestamp":1742913428869,"version":"3.40.3"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319986531"},{"type":"electronic","value":"9783319986548"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"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":[[2018]]},"DOI":"10.1007\/978-3-319-98654-8_24","type":"book-chapter","created":{"date-parts":[[2018,8,4]],"date-time":"2018-08-04T19:43:57Z","timestamp":1533411837000},"page":"291-303","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Complexity of Decision Problems on Totally Rigid Acyclic Tree Grammars"],"prefix":"10.1007","author":[{"given":"Sebastian","family":"Eberhard","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gabriel","family":"Ebner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefan","family":"Hetzl","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,8,5]]},"reference":[{"issue":"4\u20135","key":"24_CR1","doi-asserted-by":"publisher","first-page":"456","DOI":"10.1016\/j.is.2008.01.004","volume":"33","author":"G Busatto","year":"2008","unstructured":"Busatto, G., Lohrey, M., Maneth, S.: Efficient memory representation of XML document trees. Inf. Syst. 33(4\u20135), 456\u2013474 (2008)","journal-title":"Inf. Syst."},{"key":"24_CR2","unstructured":"Casel, K., Fernau, H., Gaspers, S., Gras, B., Schmid, M.L.: On the complexity of grammar-based compression over fixed alphabets. In: Chatzigiannakis, I., Mitzenmacher, M., Rabani, Y., Sangiorgi, D. (eds.) Leibniz International Proceedings in Informatics (LIPIcs) 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016), vol. 55, pp. 122:1\u2013122:14 (2016)"},{"issue":"4","key":"24_CR3","doi-asserted-by":"publisher","first-page":"26:1","DOI":"10.1145\/3127401","volume":"18","author":"S Eberhard","year":"2017","unstructured":"Eberhard, S., Ebner, G., Hetzl, S.: Algorithmic compression of finite tree languages by rigid acyclic grammars. ACM Trans. Comput. Log. 18(4), 26:1\u201326:20 (2017)","journal-title":"ACM Trans. Comput. Log."},{"issue":"6","key":"24_CR4","doi-asserted-by":"publisher","first-page":"665","DOI":"10.1016\/j.apal.2015.01.002","volume":"166","author":"S Eberhard","year":"2015","unstructured":"Eberhard, S., Hetzl, S.: Inductive theorem proving based on tree grammars. Ann. Pure Appl. Log. 166(6), 665\u2013700 (2015)","journal-title":"Ann. Pure Appl. Log."},{"key":"24_CR5","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/j.ic.2017.09.001","volume":"259","author":"S Eberhard","year":"2018","unstructured":"Eberhard, S., Hetzl, S.: On the compressibility of finite languages and formal proofs. Inf. Comput. 259, 191\u2013213 (2018)","journal-title":"Inf. Comput."},{"key":"24_CR6","doi-asserted-by":"crossref","unstructured":"Ebner, G., Hetzl, S., Leitsch, A., Reis, G., Weller, D.: On the generation of quantified lemmas. J. Autom. Reason. pp. 1\u201332 (2018)","DOI":"10.1007\/s10817-018-9462-8"},{"key":"24_CR7","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1007\/978-3-319-40229-1_20","volume-title":"Automated Reasoning","author":"G Ebner","year":"2016","unstructured":"Ebner, G., Hetzl, S., Reis, G., Riener, M., Wolfsteiner, S., Zivota, S.: System description: GAPT 2.0. In: Olivetti, N., Tiwari, A. (eds.) IJCAR 2016. LNCS (LNAI), vol. 9706, pp. 293\u2013301. Springer, Cham (2016). \n                    https:\/\/doi.org\/10.1007\/978-3-319-40229-1_20"},{"key":"24_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1007\/978-3-642-28332-1_26","volume-title":"Language and Automata Theory and Applications","author":"S Hetzl","year":"2012","unstructured":"Hetzl, S.: Applying tree languages in proof theory. In: Dediu, A.-H., Mart\u00edn-Vide, C. (eds.) LATA 2012. LNCS, vol. 7183, pp. 301\u2013312. Springer, Heidelberg (2012). \n                    https:\/\/doi.org\/10.1007\/978-3-642-28332-1_26"},{"key":"24_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.tcs.2014.05.018","volume":"549","author":"S Hetzl","year":"2014","unstructured":"Hetzl, S., Leitsch, A., Reis, G., Weller, D.: Algorithmic introduction of quantified cuts. Theor. Comput. Sci. 549, 1\u201316 (2014)","journal-title":"Theor. Comput. Sci."},{"key":"24_CR10","doi-asserted-by":"crossref","unstructured":"Hetzl, S., Stra\u00dfburger, L.: Herbrand-confluence. Log. Methods Comput. Sci. 9(4) (2013)","DOI":"10.2168\/LMCS-9(4:24)2013"},{"issue":"3","key":"24_CR11","doi-asserted-by":"publisher","first-page":"486","DOI":"10.1016\/j.ic.2010.11.015","volume":"209","author":"F Jacquemard","year":"2011","unstructured":"Jacquemard, F., Klay, F., Vacher, C.: Rigid tree automata and applications. Inf. Comput. 209(3), 486\u2013512 (2011)","journal-title":"Inf. Comput."},{"issue":"3","key":"24_CR12","doi-asserted-by":"publisher","first-page":"737","DOI":"10.1109\/18.841160","volume":"46","author":"JC Kieffer","year":"2000","unstructured":"Kieffer, J.C., Yang, E.H.: Grammar-based codes: a new class of universal lossless source codes. IEEE Trans. Inf. Theory 46(3), 737\u2013754 (2000)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"24_CR13","doi-asserted-by":"crossref","unstructured":"Larsson, N.J., Moffat, A.: Offline dictionary-based compression. In: Data Compression Conference (DCC 1999), pp. 296\u2013305. IEEE Computer Society (1999)","DOI":"10.1109\/DCC.1999.755679"},{"issue":"8","key":"24_CR14","doi-asserted-by":"publisher","first-page":"1150","DOI":"10.1016\/j.is.2013.06.006","volume":"38","author":"M Lohrey","year":"2013","unstructured":"Lohrey, M., Maneth, S., Mennicke, R.: XML tree structure compression using repair. Inf. Syst. 38(8), 1150\u20131167 (2013)","journal-title":"Inf. Syst."},{"key":"24_CR15","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1613\/jair.374","volume":"7","author":"CG Nevill-Manning","year":"1997","unstructured":"Nevill-Manning, C.G., Witten, I.H.: Identifying hierarchical structure in sequences: a linear-time algorithm. J. Artif. Intell. Res. 7, 67\u201382 (1997)","journal-title":"J. Artif. Intell. Res."},{"key":"24_CR16","doi-asserted-by":"crossref","unstructured":"Storer, J.A., Szymanski, T.G.: The macro model for data compression (extended abstract). In: Proceedings of the Tenth Annual ACM Symposium on Theory of Computing (STOC 1978), pp. 30\u201339. ACM, New York (1978)","DOI":"10.1145\/800133.804329"},{"issue":"4","key":"24_CR17","doi-asserted-by":"publisher","first-page":"928","DOI":"10.1145\/322344.322346","volume":"29","author":"JA Storer","year":"1982","unstructured":"Storer, J.A., Szymanski, T.G.: Data compression via textural substitution. J. ACM 29(4), 928\u2013951 (1982)","journal-title":"J. ACM"},{"key":"24_CR18","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1007\/978-3-540-39917-9_25","volume-title":"Inductive Logic Programming","author":"K Yamagata","year":"2003","unstructured":"Yamagata, K., Uchida, T., Shoudai, T., Nakamura, Y.: An effective grammar-based compression algorithm for tree structured data. In: Horv\u00e1th, T., Yamamoto, A. (eds.) ILP 2003. LNCS (LNAI), vol. 2835, pp. 383\u2013400. Springer, Heidelberg (2003). \n                    https:\/\/doi.org\/10.1007\/978-3-540-39917-9_25"}],"container-title":["Lecture Notes in Computer Science","Developments in Language Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-98654-8_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,9,2]],"date-time":"2018-09-02T19:14:43Z","timestamp":1535915683000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-98654-8_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319986531","9783319986548"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-98654-8_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]}}}