Generalized Circular One-Way Jumping Finite Automata
| Autor: | Mishra, Ujjwal Kumar, Mahalingam, Kalpana, Raghavan, Rama |
|---|---|
| Rok vydání: | 2021 |
| Předmět: | |
| Druh dokumentu: | Working Paper |
| Popis: | A discontinuous model of computation called one-way jumping finite automata was defined by H. Chigahara et. al. This model was a restricted version of the model jumping finite automata. One-way jumping finite automata change their states after deleting a letter of an input and jump only in one direction. Allowing a state to delete a subword instead of a letter, we define a new model generalized circular one-way jumping finite automata. These automata work on an input in a circular manner. Similar to one-way jumping finite automata, generalized circular one-way jumping finite automata also jump only in one direction. We show that this newly defined model is powerful than one-way jumping finite automata. We define new variants(right and left) of the model generalized circular one-way jumping finite automata and compare them. We also compare the newly defined model with Chomsky hierarchy. Finally, we explore closure properties of the model. Comment: 18 pages, 4 figures. arXiv admin note: substantial text overlap with arXiv:2106.02937 |
| Databáze: | arXiv |
| Externí odkaz: |
|