上下文无关语言和规则语言的紧密性、稀疏性和段等价性的复杂性

{"title":"上下文无关语言和规则语言的紧密性、稀疏性和段等价性的复杂性","authors":"D. Huynh","doi":"10.1007/978-3-322-95233-2_14","DOIUrl":null,"url":null,"abstract":"","PeriodicalId":240111,"journal":{"name":"Jahrestagung der Gesellschaft für Informatik","volume":"2 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Complexity of Closeness, Sparseness and Segment Equivalence for Context-Free and Regular Languages\",\"authors\":\"D. Huynh\",\"doi\":\"10.1007/978-3-322-95233-2_14\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"\",\"PeriodicalId\":240111,\"journal\":{\"name\":\"Jahrestagung der Gesellschaft für Informatik\",\"volume\":\"2 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1900-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Jahrestagung der Gesellschaft für Informatik\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1007/978-3-322-95233-2_14\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Jahrestagung der Gesellschaft für Informatik","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1007/978-3-322-95233-2_14","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}