{"title":"多头有限自动机的一些性质","authors":"Oscar H. Ibarra, Sam M. Kim, Louis E. Rosier","doi":"10.1016/S0019-9958(85)80029-2","DOIUrl":null,"url":null,"abstract":"<div><p>We give characterizations of multihead two-way finite automata in terms of multihead reversal-bounded pushdown automata and restricted checking stack automata. In particular, we show that a language is accepted by a 2<em>k</em>-head two-way finite automaton if and only if it is accepted by a <em>k</em>-head two-way pushdown automaton which makes one reversal on its stack. We also show that a 2-head two-way deterministic finite automaton is equivalent to a simple type of two-way deterministic checking stack automaton. This is in contrast to a previously known result which shows that simple two-way nondeterministic checking stack automata are equivalent to nondeterministic linear bounded automata.</p></div>","PeriodicalId":38164,"journal":{"name":"信息与控制","volume":"67 1","pages":"Pages 114-125"},"PeriodicalIF":0.0000,"publicationDate":"1985-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S0019-9958(85)80029-2","citationCount":"5","resultStr":"{\"title\":\"Some characterizations of multihead finite automata\",\"authors\":\"Oscar H. Ibarra, Sam M. Kim, Louis E. Rosier\",\"doi\":\"10.1016/S0019-9958(85)80029-2\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>We give characterizations of multihead two-way finite automata in terms of multihead reversal-bounded pushdown automata and restricted checking stack automata. In particular, we show that a language is accepted by a 2<em>k</em>-head two-way finite automaton if and only if it is accepted by a <em>k</em>-head two-way pushdown automaton which makes one reversal on its stack. We also show that a 2-head two-way deterministic finite automaton is equivalent to a simple type of two-way deterministic checking stack automaton. This is in contrast to a previously known result which shows that simple two-way nondeterministic checking stack automata are equivalent to nondeterministic linear bounded automata.</p></div>\",\"PeriodicalId\":38164,\"journal\":{\"name\":\"信息与控制\",\"volume\":\"67 1\",\"pages\":\"Pages 114-125\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1985-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://sci-hub-pdf.com/10.1016/S0019-9958(85)80029-2\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"信息与控制\",\"FirstCategoryId\":\"1093\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0019995885800292\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"Mathematics\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"信息与控制","FirstCategoryId":"1093","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0019995885800292","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"Mathematics","Score":null,"Total":0}
Some characterizations of multihead finite automata
We give characterizations of multihead two-way finite automata in terms of multihead reversal-bounded pushdown automata and restricted checking stack automata. In particular, we show that a language is accepted by a 2k-head two-way finite automaton if and only if it is accepted by a k-head two-way pushdown automaton which makes one reversal on its stack. We also show that a 2-head two-way deterministic finite automaton is equivalent to a simple type of two-way deterministic checking stack automaton. This is in contrast to a previously known result which shows that simple two-way nondeterministic checking stack automata are equivalent to nondeterministic linear bounded automata.