{"title":"确定规则树语言的自顶向下决定论","authors":"Peter Leupold, S. Maneth","doi":"10.1007/978-3-030-86593-1_24","DOIUrl":null,"url":null,"abstract":"","PeriodicalId":335412,"journal":{"name":"International Symposium on Fundamentals of Computation Theory","volume":"174 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-07-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Deciding Top-Down Determinism of Regular Tree Languages\",\"authors\":\"Peter Leupold, S. Maneth\",\"doi\":\"10.1007/978-3-030-86593-1_24\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"\",\"PeriodicalId\":335412,\"journal\":{\"name\":\"International Symposium on Fundamentals of Computation Theory\",\"volume\":\"174 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-07-07\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Symposium on Fundamentals of Computation Theory\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1007/978-3-030-86593-1_24\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Symposium on Fundamentals of Computation Theory","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1007/978-3-030-86593-1_24","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}