{"title":"Decidability of the HD0L ultimate periodicity problem","authors":"F. Durand","doi":"10.1051/ita/2013035","DOIUrl":null,"url":null,"abstract":"In this paper we prove the decidability of the HD0L ultimate periodicity problem.","PeriodicalId":438841,"journal":{"name":"RAIRO Theor. Informatics Appl.","volume":"21 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"32","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"RAIRO Theor. Informatics Appl.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1051/ita/2013035","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 32
Abstract
In this paper we prove the decidability of the HD0L ultimate periodicity problem.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
