{"title":"寄存器上下文无关语法和寄存器树自动机的复杂性结果","authors":"Ryoma Senda, Y. Takata, H. Seki","doi":"10.1007/978-3-030-02508-3_22","DOIUrl":null,"url":null,"abstract":"","PeriodicalId":142552,"journal":{"name":"International Colloquium on Theoretical Aspects of Computing","volume":"71 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"Complexity Results on Register Context-Free Grammars and Register Tree Automata\",\"authors\":\"Ryoma Senda, Y. Takata, H. Seki\",\"doi\":\"10.1007/978-3-030-02508-3_22\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"\",\"PeriodicalId\":142552,\"journal\":{\"name\":\"International Colloquium on Theoretical Aspects of Computing\",\"volume\":\"71 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-10-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Colloquium on Theoretical Aspects of Computing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1007/978-3-030-02508-3_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":"International Colloquium on Theoretical Aspects of Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1007/978-3-030-02508-3_22","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}