在多项式时间内识别根上下文无关的流程图语言

{"title":"在多项式时间内识别根上下文无关的流程图语言","authors":"U. Lichtblau","doi":"10.1007/BFb0017411","DOIUrl":null,"url":null,"abstract":"","PeriodicalId":303027,"journal":{"name":"Graph-Grammars and Their Application to Computer Science","volume":"32 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1990-03-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"15","resultStr":"{\"title\":\"Recognizing Rooted Context-free Flowgraph Languages in Polynomial Time\",\"authors\":\"U. Lichtblau\",\"doi\":\"10.1007/BFb0017411\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"\",\"PeriodicalId\":303027,\"journal\":{\"name\":\"Graph-Grammars and Their Application to Computer Science\",\"volume\":\"32 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1990-03-05\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"15\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Graph-Grammars and Their Application to Computer Science\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1007/BFb0017411\",\"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","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1007/BFb0017411","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}