{"title":"上下文无关图语言的抽运引理","authors":"H. Kreowski","doi":"10.1007/BFb0025726","DOIUrl":null,"url":null,"abstract":"","PeriodicalId":297591,"journal":{"name":"Graph-Grammars and Their Application to Computer Science and Biology","volume":"274 9","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1978-10-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"28","resultStr":"{\"title\":\"A Pumping Lemma for Context-Free Graph Languages\",\"authors\":\"H. Kreowski\",\"doi\":\"10.1007/BFb0025726\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"\",\"PeriodicalId\":297591,\"journal\":{\"name\":\"Graph-Grammars and Their Application to Computer Science and Biology\",\"volume\":\"274 9\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1978-10-30\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"28\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Graph-Grammars and Their Application to Computer Science and Biology\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1007/BFb0025726\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Graph-Grammars and Their Application to Computer Science and Biology","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1007/BFb0025726","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}