{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:50:55Z","timestamp":1725490255967},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540749141"},{"type":"electronic","value":"9783540749158"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-74915-8_14","type":"book-chapter","created":{"date-parts":[[2007,8,24]],"date-time":"2007-08-24T01:13:35Z","timestamp":1187918015000},"page":"146-160","source":"Crossref","is-referenced-by-count":4,"title":["Forest Expressions"],"prefix":"10.1007","author":[{"given":"Miko\u0142aj","family":"Boja\u0144czyk","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"14_CR1","unstructured":"Boja\u0144czyk, M., Walukiewicz, I.: Forest algebras (unpublished manuscript), \n \n http:\/\/hal.archives-ouvertes.fr\/ccsd-00105796"},{"key":"14_CR2","unstructured":"Comon, H., Dauchet, M., Gilleron, R., Jacquemard, F., Lugiez, D., Tison, S., Tommasi, M.: Tree automata techniques and applications, 2002 (October 1, 2002), Available on: \n \n http:\/\/www.grappa.univ-lille3.fr\/tata"},{"key":"14_CR3","volume-title":"Counter-Free Automata","author":"R. McNaughton","year":"1971","unstructured":"McNaughton, R., Papert, S.: Counter-Free Automata. MIT Press, Cambridge (1971)"},{"key":"14_CR4","doi-asserted-by":"publisher","first-page":"360","DOI":"10.1016\/0022-0000(82)90016-2","volume":"25","author":"W. Thomas","year":"1982","unstructured":"Thomas, W.: Classifying regular events in symbolic logic. Journal of Computer and System Sciences\u00a025, 360\u2013375 (1982)","journal-title":"Journal of Computer and System Sciences"},{"key":"14_CR5","unstructured":"Thomas, W.: Logical aspects in the study of tree languages. In: Colloquium on Trees and Algebra in Programming, pp. 31\u201350 (1984)"},{"key":"14_CR6","unstructured":"Thomas, W.: On chain logic, path logic, and first-order logic over infinite trees. In: Logic in Computer Science, pp. 245\u2013256 (1987)"}],"container-title":["Lecture Notes in Computer Science","Computer Science Logic"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-74915-8_14.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T06:45:45Z","timestamp":1619505945000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74915-8_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540749141","9783540749158"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74915-8_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}