Corpus ID: 235367708

Generalized Circular One-Way Jumping Finite Automata

@article{Mishra2021GeneralizedCO,
  title={Generalized Circular One-Way Jumping Finite Automata},
  author={U. K. Mishra and K. Mahalingam and Rama Raghavan},
  journal={ArXiv},
  year={2021},
  volume={abs/2106.03852}
}
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… Expand

References

SHOWING 1-10 OF 17 REFERENCES
Generalized Linear One-Way Jumping Finite Automata
A new 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. TheseExpand
One-Way Jumping Finite Automata
We propose the one-way jumping finite automaton model, restricting the jumping relation of the recently introduced jumping finite automaton so that the machine can only jump over symbols it cannotExpand
Properties of Right One-Way Jumping Finite Automata
TLDR
The family of permutation closed languages accepted by ROWJFAs in terms of Myhill-Nerode equivalence classes is characterized in particular, in order to investigate closure and non-closure properties as well as inclusion relations to other language families. Expand
Two-Way Jumping Automata
TLDR
It is shown that two- way jumping automata are strictly more powerful than one-way jumping ones and that alternative extensions of 2DFA with jumping mode lead to equivalent machines, and it is shown how one could change the model to terminate on every input. Expand
Nondeterministic right one-way jumping finite automata
TLDR
The impact on the computational power of right-one way jumping finite automata when allowing multiple initial states and/or a nondeterministic transition function including spontaneous or λ-transitions is studied. Expand
Decidability of Right One-Way Jumping Finite Automata
TLDR
It turns out that most problems such as, e.g., emptiness, finiteness, universality, the word problem and variants thereof, closure under permutation, etc., are decidable. Expand
Jumping Finite Automata
TLDR
The paper establishes several results concerning jumping finite automata in terms of commonly investigated areas of automata theory, such as decidability and closure properties, and achieves several results that demonstrate differences between jumping finiteAutomata and classical finite Automata. Expand
On Parallel Versions of Jumping Finite Automata
TLDR
These automata further extend recently presented jumping finite automata that are focused on discontinuous reading and uses multiple reading heads that work in parallel and can discontinuously read from the input in several places at once. Expand
On double-jumping finite automata and their closure properties
TLDR
The paper investigates the mutual relation between the language families resulting from jumping finite automata performing the jumps in these ways and the families of regular, linear, context-free, and context-sensitive languages. Expand
Operational State Complexity and Decidability of Jumping Finite Automata
We consider jumping finite automata and their operational state complexity and decidability status. Roughly speaking, a jumping automaton is a finite automaton with a non-continuous input. ThisExpand
...
1
2
...