{"title":"分解森林定理","authors":"Thomas Colcombet","doi":"10.4171/Automata-1/18","DOIUrl":null,"url":null,"abstract":"5 Abstract. This chapter is devoted to the presentation of the factorisa tion forest theorem, a deep result due to Simon, which provides advanced Ramsey-like arguments in the context of algebra, au- tomata, and logic. We present several proofs and several variants the result, as well as applications.","PeriodicalId":267596,"journal":{"name":"Handbook of Automata Theory","volume":"49 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"The factorisation forest theorem\",\"authors\":\"Thomas Colcombet\",\"doi\":\"10.4171/Automata-1/18\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"5 Abstract. This chapter is devoted to the presentation of the factorisa tion forest theorem, a deep result due to Simon, which provides advanced Ramsey-like arguments in the context of algebra, au- tomata, and logic. We present several proofs and several variants the result, as well as applications.\",\"PeriodicalId\":267596,\"journal\":{\"name\":\"Handbook of Automata Theory\",\"volume\":\"49 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1900-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Handbook of Automata Theory\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.4171/Automata-1/18\",\"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/18","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
5 Abstract. This chapter is devoted to the presentation of the factorisa tion forest theorem, a deep result due to Simon, which provides advanced Ramsey-like arguments in the context of algebra, au- tomata, and logic. We present several proofs and several variants the result, as well as applications.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
