Watson–Crick Jumping Finite Automata: Combination, Comparison and Closure
| Autor: | Kalpana Mahalingam, Raghavan Rama, Ujjwal Kumar Mishra |
|---|---|
| Rok vydání: | 2021 |
| Předmět: |
Discrete mathematics
Finite-state machine General Computer Science Computer science Closure (topology) Molecular Structure of Nucleic Acids: A Structure for Deoxyribose Nucleic Acid 0102 computer and information sciences 02 engineering and technology medicine.disease_cause 01 natural sciences Jumping 010201 computation theory & mathematics 0202 electrical engineering electronic engineering information engineering medicine 020201 artificial intelligence & image processing Computer Science::Formal Languages and Automata Theory |
| Zdroj: | The Computer Journal. 65:1178-1188 |
| ISSN: | 1460-2067 0010-4620 |
| Popis: | 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. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|