{"title":"A Note on the Emptiness of Intersection Problem for Left Szilard Languages","authors":"E. Mäkinen","doi":"10.14232/actacyb.22.3.2016.4","DOIUrl":null,"url":null,"abstract":"As left Szilard languages form a subclass of simple deterministiclanguages and even a subclass of super-deterministic languages, weknow that their equivalence problem is decidable. In this note weshow that their emptiness of intersection problem is undecidable.The proof follows the lines of the correponding proof for simpledeterministic languages, but some technical tricks are needed. Thisresult sharpens the borderline between decidable and undecidableproblems in formal language theory.","PeriodicalId":187125,"journal":{"name":"Acta Cybern.","volume":"31 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Acta Cybern.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.14232/actacyb.22.3.2016.4","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
As left Szilard languages form a subclass of simple deterministiclanguages and even a subclass of super-deterministic languages, weknow that their equivalence problem is decidable. In this note weshow that their emptiness of intersection problem is undecidable.The proof follows the lines of the correponding proof for simpledeterministic languages, but some technical tricks are needed. Thisresult sharpens the borderline between decidable and undecidableproblems in formal language theory.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
