Nondeterministic right one-way jumping finite automata

Beier, Simon; Holzer, Markus

doi:10.1016/j.ic.2021.104687

Cited by 9 publications

(8 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Let x, y ∈ Σ * , u ∈ Σ + and p, q ∈ Q. Now, pxuy A1 qyx if and only if (p, u, q) ∈ R, x does not contain any word from Σ R,p as a subword and x ′′ u ′ = u, where x ′′ is a nonempty suffix of x and u ′ is a nonempty prefix of u if and only if (q, u R , p) ∈ R ′ , x R does not contain any word from Σ R ′ ,p as a subword and u (2) x (1) = u R , where x (1) is a nonempty prefix of x R and u (2) is a nonempty suffix of u R if and only if…”

Section: Grcowjfa and Glcowjfamentioning

confidence: 99%

See 1 more Smart Citation

Generalized Circular One-Way Jumping Finite Automata

Mishra¹,

Mahalingam²,

Rama³

2021

Preprint

View full text Add to dashboard Cite

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.

show abstract

Section: Grcowjfa and Glcowjfamentioning

confidence: 99%

“…The model was extensively studied in [16,17,4,8]. Following [14], several jumping transition models have been introduced and studied in the last few years [5,15,10,2,6,9,13,11,7].…”

Section: Introductionmentioning

confidence: 99%

Generalized Circular One-Way Jumping Finite Automata

Mishra¹,

Mahalingam²,

Rama³

2021

Preprint

View full text Add to dashboard Cite

show abstract

“…Let x, y, z ∈ Σ * , u ∈ Σ + and p, q ∈ Q. Now, xpyuz A1 xyqz if and only if (p, u, q) ∈ R, y does not contain any word from Σ R,p as a subword and y ′′ u ′ = u, where y ′′ is a nonempty suffix of y and u ′ is a nonempty prefix of u if and only if (q, u R , p) ∈ R ′ , y R does not contain any word from Σ R ′ ,p as a subword and u (2) y (1) = u R , where y (1) is a nonempty prefix of y R and u (2) is a nonempty suffix of u R if and…”

Section: Grlowjfa and Gllowjfamentioning

confidence: 99%

“…Results related to the complexity of the model JFA were discussed in [7] and [4]. Following [13], several other jumping transition models have been defined and studied in [9,5,2,6,8,12,10].…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Generalized Linear One-Way Jumping Finite Automata

Mishra,

Mahalingam,

Raghavan

2021

Preprint

View full text Add to dashboard Cite

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. These automata read an input symbol-by-symbol and jump only in one direction. A generalized linear one-way jumping finite automaton makes jumps after deleting a substring of an input string and then changes its state. These automata can make sequence of jumps in only one direction on an input string either from left to right or from right to left. We show that newly defined model is powerful than its original counterpart. We define and compare the variants, generalized right linear one-way jumping finite automata and generalized left linear one-way jumping finite automata. We also compare the newly defined models with Chomsky hierarchy. Finally, we explore closure properties of the model.

show abstract

A Survey on Automata with Translucent Letters

Otto

2023

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Nondeterministic right one-way jumping finite automata

Cited by 9 publications

References 5 publications

Generalized Circular One-Way Jumping Finite Automata

Generalized Circular One-Way Jumping Finite Automata

Generalized Linear One-Way Jumping Finite Automata

A Survey on Automata with Translucent Letters

Contact Info

Product

Resources

About