Watson–Crick Jumping Finite Automata: Combination, Comparison and Closure
Keyword(s):
Abstract A new model of computation called Watson–Crick jumping finite automata was introduced by Mahalingam et al., and the authors study the computing power and closure properties of the variants of the model. There are four variants of the model: no state, 1-limited, all-final and simple Watson–Crick jumping finite automata. In this paper, we introduce a restricted version that is a combination of variants of the existing model. It becomes essential to explore the computing power and closure properties of these combinations. The combination variants are extensively compared with Chomsky hierarchy, general jumping finite automata family and among themselves. We also explore the closure properties of such restricted automata.
2020 ◽
Vol 31
(07)
◽
pp. 891-913
Keyword(s):
2013 ◽
Vol 24
(06)
◽
pp. 863-878
◽
Keyword(s):
2018 ◽
Vol 29
(02)
◽
pp. 213-231
1997 ◽
Vol 11
(07)
◽
pp. 1023-1024
2006 ◽
Vol 16
(05)
◽
pp. 985-1014
◽
Keyword(s):
Keyword(s):
2015 ◽
Vol 373
(2046)
◽
pp. 20140223
◽
Keyword(s):
2012 ◽
Vol 23
(06)
◽
pp. 1207-1225
◽