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