{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T06:03:40Z","timestamp":1725516220435},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540705888"},{"type":"electronic","value":"9783540705901"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-70590-1_20","type":"book-chapter","created":{"date-parts":[[2008,8,12]],"date-time":"2008-08-12T16:07:43Z","timestamp":1218557263000},"page":"291-305","source":"Crossref","is-referenced-by-count":1,"title":["Tree Automata for Non-linear Arithmetic"],"prefix":"10.1007","author":[{"given":"Naoki","family":"Kobayashi","sequence":"first","affiliation":[]},{"given":"Hitoshi","family":"Ohsaki","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"20_CR1","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781139172752","volume-title":"Term Rewriting and All That","author":"F. Baader","year":"1998","unstructured":"Baader, F., Nipkow, T.: Term Rewriting and All That. Cambridge University Press, Cambridge (1998)"},{"key":"20_CR2","first-page":"280","volume-title":"Proc. of 20th LICS","author":"I. Boneva","year":"2005","unstructured":"Boneva, I., Talbot, J.-M., Tison, S.: Expressiveness of a Spatial Logic for Trees. In: Proc. of 20th LICS, Chicago (USA), pp. 280\u2013289. IEEE Computer Society, Los Alamitos (2005)"},{"key":"20_CR3","unstructured":"Comon-Lundh, H., Dauchet, M., Gilleron, R., Jacquemard, F., Lugiez, D., Tison, S., Tommasi, M.: Tree Automata Techniques and Applications, draft (2005), http:\/\/www.grappa.univ-lille3.fr\/tata"},{"key":"20_CR4","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/s00200-006-0016-7","volume":"17","author":"S. Zilio Dal","year":"2006","unstructured":"Dal Zilio, S., Lugiez, D.: XML Schema, Tree Logic and Sheaves Automata. Applicable Algebra in Engineering, Communication and Computing\u00a017, 337\u2013377 (2006)","journal-title":"Applicable Algebra in Engineering, Communication and Computing"},{"key":"20_CR5","doi-asserted-by":"crossref","first-page":"285","DOI":"10.2140\/pjm.1966.16.285","volume":"16","author":"S. Ginsburg","year":"1966","unstructured":"Ginsburg, S., Spanier, E.H.: Semigroups, Presburger Formulas, and Languages. Pacific Journal of Mathematics\u00a016, 285\u2013296 (1966)","journal-title":"Pacific Journal of Mathematics"},{"key":"20_CR6","volume-title":"The Mathematical Theory of Context-Free Languages","author":"S. Ginsburg","year":"1966","unstructured":"Ginsburg, S.: The Mathematical Theory of Context-Free Languages. McGraw-Hill, New York (1966)"},{"key":"20_CR7","unstructured":"Hack, M.H.T.: Decidability Questions for Petri Nets, Ph.D. thesis, Massachusetts Institute of Technology, USA (1976)"},{"key":"20_CR8","series-title":"Extended version","volume-title":"Proc. of 11th LICS","author":"T.A. Henzinger","year":"1996","unstructured":"Henzinger, T.A.: The Theory of Hybrid Automata. In: Proc. of 11th LICS, New Brunswick (USA). IEEE Computer Society, Los Alamitos (1996) (Extended version), http:\/\/mtc.epfl.ch\/~tah\/Publications"},{"key":"20_CR9","doi-asserted-by":"crossref","unstructured":"Hinman, P.G.: Fundamentals of Mathematical Logic. A K Peters (2005)","DOI":"10.1201\/b10690"},{"key":"20_CR10","unstructured":"Kobayashi, N., Ohsaki, H.: Tree Automata for Non-Linear Arithmetic, draft (February 2008), http:\/\/staff.aist.go.jp\/hitoshi.ohsaki\/"},{"key":"20_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/3-540-45523-X_8","volume-title":"Multiset Processing","author":"M. Kudlek","year":"2001","unstructured":"Kudlek, M., Mitrana, V.: Normal Forms of Grammars, Finite Automata, Abstract Families, and Closure Properties of Multiset Languages. In: Calude, C.S., Pun, G., Rozenberg, G., Salomaa, A. (eds.) Multiset Processing. LNCS, vol.\u00a02235, pp. 135\u2013146. Springer, Heidelberg (2001)"},{"key":"20_CR12","unstructured":"Landweber, L.H.: Properties of Vector Addition Systems, Technical Report 258, University of Wisconsin-Madison, USA (1975)"},{"key":"20_CR13","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1016\/j.tcs.2004.10.023","volume":"333","author":"D. Lugiez","year":"2005","unstructured":"Lugiez, D.: Multitree Automata That Count. TCS\u00a0333, 225\u2013263 (2005)","journal-title":"TCS"},{"key":"20_CR14","volume-title":"Hilbert\u2019s Tenth Problem","author":"Y. Matiyasevich","year":"1993","unstructured":"Matiyasevich, Y.: Hilbert\u2019s Tenth Problem. MIT Press, Cambridge (1993)"},{"key":"20_CR15","series-title":"LNAI","first-page":"337","volume-title":"Proc. of 12th LPAR","author":"H. Ohsaki","year":"2005","unstructured":"Ohsaki, H., Talbot, J.-M., Tison, S., Roos, Y.: Monotone AC-Tree Automata. In: VMCAI 2006. LNCS (LNAI), vol.\u00a03855, pp. 337\u2013351. Springer, Heidelberg (2005)"},{"key":"20_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1007\/3-540-44881-0_34","volume-title":"Rewriting Techniques and Applications","author":"H. Ohsaki","year":"2003","unstructured":"Ohsaki, H., Seki, H., Takai, T.: Recognizing Boolean Closed A-Tree Languages with Membership Conditional Rewriting Mechanism. In: Nieuwenhuis, R. (ed.) RTA 2003. LNCS, vol.\u00a02706, pp. 483\u2013498. Springer, Heidelberg (2003)"},{"key":"20_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1007\/3-540-44802-0_38","volume-title":"Computer Science Logic","author":"H. Ohsaki","year":"2001","unstructured":"Ohsaki, H.: Beyond Regularity: Equational Tree Automata for Associative and Commutative Theories. In: Fribourg, L. (ed.) CSL 2001 and EACSL 2001. LNCS, vol.\u00a02142, pp. 539\u2013553. Springer, Heidelberg (2001)"},{"key":"20_CR18","doi-asserted-by":"publisher","first-page":"570","DOI":"10.1145\/321356.321364","volume":"13","author":"R. Parikh","year":"1966","unstructured":"Parikh, R.: On Context-Free Languages. JACM\u00a013, 570\u2013581 (1966)","journal-title":"JACM"},{"key":"20_CR19","first-page":"155","volume-title":"Proc. of 22nd PODS","author":"H. Seidl","year":"2003","unstructured":"Seidl, H., Schwentick, T., Muscholl, A.: Numerical Document Queries. In: Proc. of 22nd PODS, SanDiego (USA), pp. 155\u2013166. ACM, New York (2003)"},{"key":"20_CR20","doi-asserted-by":"crossref","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 Automata Theory. Journal of Computer and System Sciences\u00a01, 317\u2013322 (1967)","journal-title":"Journal of Computer and System Sciences"},{"key":"20_CR21","doi-asserted-by":"publisher","first-page":"817","DOI":"10.1016\/j.ic.2006.12.006","volume":"205","author":"K.N. Verma","year":"2007","unstructured":"Verma, K.N., Goubault-Larrecq, J.: Alternating Two-Way AC-Tree Automata. Information and Computation\u00a0205, 817\u2013869 (2007)","journal-title":"Information and Computation"}],"container-title":["Lecture Notes in Computer Science","Rewriting Techniques and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-70590-1_20.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T05:08:20Z","timestamp":1605762500000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-70590-1_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540705888","9783540705901"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-70590-1_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}