{"title":"树自动机","authors":"Olivier Gauwin","doi":"10.1201/b13055-5","DOIUrl":null,"url":null,"abstract":"Most machine models one studies in theoretical computer science, like Turing machines and finite automata, work on inputs that are strings over some finite alphabet. However, often problem descriptions have inputs that more structured than strings. For example, the input could be a graph, or a tree, or a partial order, etc. We will now introduce an automaton model that computes on inputs that are trees.","PeriodicalId":302611,"journal":{"name":"Handbook of Finite State Based Models and Applications","volume":"376 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Tree Automata\",\"authors\":\"Olivier Gauwin\",\"doi\":\"10.1201/b13055-5\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Most machine models one studies in theoretical computer science, like Turing machines and finite automata, work on inputs that are strings over some finite alphabet. However, often problem descriptions have inputs that more structured than strings. For example, the input could be a graph, or a tree, or a partial order, etc. We will now introduce an automaton model that computes on inputs that are trees.\",\"PeriodicalId\":302611,\"journal\":{\"name\":\"Handbook of Finite State Based Models and Applications\",\"volume\":\"376 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1900-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Handbook of Finite State Based Models and Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1201/b13055-5\",\"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 Finite State Based Models and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1201/b13055-5","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Most machine models one studies in theoretical computer science, like Turing machines and finite automata, work on inputs that are strings over some finite alphabet. However, often problem descriptions have inputs that more structured than strings. For example, the input could be a graph, or a tree, or a partial order, etc. We will now introduce an automaton model that computes on inputs that are trees.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
