{"title":"Systolic trellis automata: Stability, decidability and complexity","authors":"K. Culik II, J. Gruska, A. Salomaa","doi":"10.1016/S0019-9958(86)80011-0","DOIUrl":null,"url":null,"abstract":"<div><p>Systolic trellis automata are models of hexagonally connected and triangularly shaped systolic arrays. This paper studies the problems of stability, decidability, and complexity for them. The original definition of systolic trellis automata requires that an input string is fed to a specific row of processors. Here it is shown that given a homogeneous trellis automaton we can construct an equivalent one (stable or superstable) which allows to feed the input string to any sufficiently long row of processors. Moreover, some closure and decidability results for trellis automata are established and the computational complexity of languages accepted by trellis automata is investigated.</p></div>","PeriodicalId":38164,"journal":{"name":"信息与控制","volume":"71 3","pages":"Pages 218-230"},"PeriodicalIF":0.0000,"publicationDate":"1986-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S0019-9958(86)80011-0","citationCount":"36","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"信息与控制","FirstCategoryId":"1093","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0019995886800110","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"Mathematics","Score":null,"Total":0}
引用次数: 36
Abstract
Systolic trellis automata are models of hexagonally connected and triangularly shaped systolic arrays. This paper studies the problems of stability, decidability, and complexity for them. The original definition of systolic trellis automata requires that an input string is fed to a specific row of processors. Here it is shown that given a homogeneous trellis automaton we can construct an equivalent one (stable or superstable) which allows to feed the input string to any sufficiently long row of processors. Moreover, some closure and decidability results for trellis automata are established and the computational complexity of languages accepted by trellis automata is investigated.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
