{"title":"Bounded Fixed-Point Definability and Tabular Recognition of Languages","authors":"Hans Leiss","doi":"10.1007/3-540-61377-3_50","DOIUrl":null,"url":null,"abstract":"","PeriodicalId":113827,"journal":{"name":"Tabulation in Parsing and Deduction","volume":"28 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1995-09-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Tabulation in Parsing and Deduction","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1007/3-540-61377-3_50","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
