多上下文无关的树语法和多组件树相邻语法

{"title":"多上下文无关的树语法和多组件树相邻语法","authors":"J. Engelfriet, A. Maletti","doi":"10.1007/978-3-662-55751-8_18","DOIUrl":null,"url":null,"abstract":"","PeriodicalId":335412,"journal":{"name":"International Symposium on Fundamentals of Computation Theory","volume":"46 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-09-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Multiple Context-Free Tree Grammars and Multi-component Tree Adjoining Grammars\",\"authors\":\"J. Engelfriet, A. Maletti\",\"doi\":\"10.1007/978-3-662-55751-8_18\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"\",\"PeriodicalId\":335412,\"journal\":{\"name\":\"International Symposium on Fundamentals of Computation Theory\",\"volume\":\"46 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-09-11\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Symposium on Fundamentals of Computation Theory\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1007/978-3-662-55751-8_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":"International Symposium on Fundamentals of Computation Theory","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1007/978-3-662-55751-8_18","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}