{"title":"项重写理论中的树自动机","authors":"M. Steinby","doi":"10.1142/9789812704979_0034","DOIUrl":null,"url":null,"abstract":"","PeriodicalId":265391,"journal":{"name":"Words, Languages & Combinatorics","volume":"34 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2003-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Tree Automata in the Theory of Term Rewriting\",\"authors\":\"M. Steinby\",\"doi\":\"10.1142/9789812704979_0034\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"\",\"PeriodicalId\":265391,\"journal\":{\"name\":\"Words, Languages & Combinatorics\",\"volume\":\"34 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2003-07-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Words, Languages & Combinatorics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1142/9789812704979_0034\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Words, Languages & Combinatorics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1142/9789812704979_0034","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}