Properties of right one-way jumping finite automata

Beier, Simon; Holzer, Markus

doi:10.1016/j.tcs.2019.03.044

Cited by 14 publications

(14 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The classes ROWJ [5] and GRLOWJ [15] are not closed under intersection, concatenation and reversal. Moreover, ROWJ is not closed under the operation Kleene star [5], union, complement and homomorphism [3]. In the same line, we show that the class GRCOWJ is not closed under intersection, concatenation, reversal and Kleene star.…”

Section: Closure Propertiessupporting

confidence: 55%

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: Closure Propertiessupporting

confidence: 55%

“…It was proved in [3] that the language of Example 5 cannot be accepted by any ROWJFA. It was shown in [15] that the language is in the class GRLOWJ.…”

Section: Gcowjfa and Glowjfamentioning

confidence: 99%

Generalized Circular One-Way Jumping Finite Automata

Mishra¹,

Mahalingam²,

Rama³

2021

Preprint

View full text Add to dashboard Cite

show abstract

“…q 0 a n b n c a n−i qb n−j c * a n−i q (1) b n−j−j1 c q (1) a n−i b n−j−j1 c q (2) a n−i−i1 b n−j−j1 c * q f . But, then the following sequence is also possible: 3) deletes only a's, then this case becomes similar to case 1. and hence, there exists a word w ∈ L(A) but w ∈ Dc. Therefore, q (3) will have to delete a i2 b j4 , where i 2 , j 4 ≥ 1 and hence,…”

Section: Grlowjfa and Gllowjfamentioning

confidence: 98%

“…It was proved in [3] that the language of Example 4 cannot be accepted by any ROWJFA. Hence, we have the following result.…”

Section: Glowj and Owjmentioning

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

Enhancement of Automata with Jumping Modes

Fazekas

Hoshi

Yamamura

2019

Cellular Automata and Discrete Complex Systems

View full text Add to dashboard Cite

Recently, new types of non-sequential machine models have been introduced and studied, such as jumping automata and one-way jumping automata. We study the abilities and limitations of automata with these two jumping modes of tape heads with respect to how they affect the class of accepted languages. We give several methods to determine whether a language is accepted by a machine with jumping mode. We also consider relationships among the classes of languages defined by the new machines and their classical counterparts.

show abstract

Properties of right one-way jumping finite automata

Cited by 14 publications

References 13 publications

Generalized Circular One-Way Jumping Finite Automata

Generalized Circular One-Way Jumping Finite Automata

Generalized Linear One-Way Jumping Finite Automata

Enhancement of Automata with Jumping Modes

Contact Info

Product

Resources

About