{"title":"树的代数","authors":"M. Bojanczyk","doi":"10.4171/AUTOMATA-1/22","DOIUrl":null,"url":null,"abstract":"This chapter presents several algebraic approaches to tree languages. The idea is to design a notion for trees that resembles semigroups or monoids for words. The focus is on the connection between the structure of an algebra recognizing a tree language, and the kind of logic needed to define the tree language. Four algebraic approaches are described in this chapter: trees as terms of universal algebra, preclones, forest algebra, and seminearrings. Each approach is illustrated with an application to logic on trees.","PeriodicalId":267596,"journal":{"name":"Handbook of Automata Theory","volume":"136 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"Algebra for trees\",\"authors\":\"M. Bojanczyk\",\"doi\":\"10.4171/AUTOMATA-1/22\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This chapter presents several algebraic approaches to tree languages. The idea is to design a notion for trees that resembles semigroups or monoids for words. The focus is on the connection between the structure of an algebra recognizing a tree language, and the kind of logic needed to define the tree language. Four algebraic approaches are described in this chapter: trees as terms of universal algebra, preclones, forest algebra, and seminearrings. Each approach is illustrated with an application to logic on trees.\",\"PeriodicalId\":267596,\"journal\":{\"name\":\"Handbook of Automata Theory\",\"volume\":\"136 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-09-13\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Handbook of Automata Theory\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.4171/AUTOMATA-1/22\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Handbook of Automata Theory","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.4171/AUTOMATA-1/22","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
This chapter presents several algebraic approaches to tree languages. The idea is to design a notion for trees that resembles semigroups or monoids for words. The focus is on the connection between the structure of an algebra recognizing a tree language, and the kind of logic needed to define the tree language. Four algebraic approaches are described in this chapter: trees as terms of universal algebra, preclones, forest algebra, and seminearrings. Each approach is illustrated with an application to logic on trees.