Properties of Right One-Way Jumping Finite Automata

Right one-way jumping finite automata (ROWJFAs), were recently introduced in [H. Chigahara, S. Z. Fazekas, A. Yamamura: One-Way Jumping Finite Automata, Internat. J. Found. Comput. Sci., 27(3), 2016] and are jumping automata that process the input in a discontinuous way with the restriction that the input head reads deterministically from left-to-right starting from the leftmost letter in the input and when it reaches the end of the input word, it returns to the beginning and continues the computation. We solve most of the open problems of these devices. In particular, we characterize the family of permutation closed languages accepted by ROWJFAs in terms of Myhill-Nerode equivalence classes. Using this, we investigate closure and non-closure properties as well as inclusion relations to other language families. We also give more characterizations of languages accepted by ROWJFAs for some interesting cases.

[1]  Alexander Meduna,et al.  Regulated Grammars and Automata , 2014, Springer New York.

[2]  Hermann Gruber,et al.  August 2009 Simplifying Regular Expressions : A Quantitative Perspective , 2009 .

[3]  Markus Holzer,et al.  On the Computational Complexity of Partial Word Automata Problems , 2016, Fundam. Informaticae.

[4]  守屋 悦朗,et al.  J.E.Hopcroft, J.D. Ullman 著, "Introduction to Automata Theory, Languages, and Computation", Addison-Wesley, A5変形版, X+418, \6,670, 1979 , 1980 .

[5]  Henning Fernau,et al.  Characterization and complexity results on jumping finite automata , 2017, Theor. Comput. Sci..

[6]  Markus Holzer,et al.  Tight Bounds on the Descriptional Complexity of Regular Expressions , 2009, Developments in Language Theory.

[7]  M. Holzer,et al.  Informatik Regular Expressions From Deterministic Finite Automata , Revisited , 2014 .

[8]  Martin Kutrib,et al.  Nondeterministic Descriptional Complexity Of Regular Languages , 2003, Int. J. Found. Comput. Sci..

[9]  Jeffrey D. Ullman,et al.  Introduction to Automata Theory, Languages and Computation , 1979 .

[10]  Martin Kutrib,et al.  Improving Raster Image Run-Length Encoding Using Data Order , 2001, CIAA.

[11]  Martin Kutrib,et al.  Fast one-way cellular automata , 2003, Theor. Comput. Sci..

[12]  Martin Kutrib,et al.  Operational State Complexity and Decidability of Jumping Finite Automata , 2017, DLT.

[13]  Akihiro Yamamura,et al.  One-Way Jumping Finite Automata , 2016, Int. J. Found. Comput. Sci..

[14]  Markus Holzer,et al.  On the Complexity of Rolling Block and Alice Mazes , 2012, FUN.

[15]  L. Dickson.  Finiteness of the Odd Perfect and Primitive Abundant Numbers with n Distinct Prime Factors , 1913 .

[16]  Martin Kutrib,et al.  Unary Language Operations and Their Nondeterministic State Complexity , 2002, Developments in Language Theory.

[17]  Christopher Culy,et al.  Formal properties of natural language and linguistic theories , 1996 .

[18]  M. Holzer,et al.  April 2017 A Note on the Computational Complexity of Some Problems for Self-Verifying Finite Automata , 2017 .

[19]  Alexander Meduna,et al.  Jumping Finite Automata , 2012, Int. J. Found. Comput. Sci..

[20]  Alexander Meduna,et al.  Chapter 17 Jumping Finite Automata , 2014 .

[21]  Martin Kutrib,et al.  String Transformation for n -Dimensional Image Compression , 2002, SOFSEM.

[22]  Martin Kutrib,et al.  On input-revolving deterministic and nondeterministic finite automata , 2009, Inf. Comput..

[23]  Markus Holzer,et al.  Grid Graphs with Diagonal Edges and the Complexity of Xmas Mazes , 2012, FUN.

[24]  S. Ginsburg,et al.  BOUNDED ALGOL-LIKE LANGUAGES^) , 1964 .

[25]  Henning Fernau,et al.  Jumping Finite Automata: Characterizations and Complexity , 2015, CIAA.

[26]  Andreas Malcher,et al.  Descriptional Complexity of Pushdown Store Languages , 2012, J. Autom. Lang. Comb..

[27]  Martin Kutrib,et al.  Cellular automata with sparse communication , 2010, Theor. Comput. Sci..

[28]  Martin Kutrib,et al.  Economy of Descriptions for Basic Constructions on Rational Transductions , 2002, DCFS.

[29]  M. Holzer,et al.  October 2017 On the Magic Number Problem of the Cut Operation , 2017 .

[30]  Sheila A. Greibach,et al.  An Infinite Hierarchy of Context-Free Languages , 1967, JACM.

[31]  Rohit Parikh,et al.  On Context-Free Languages , 1966, JACM.

[32]  Andreas Maletti,et al.  An nlogn Algorithm for Hyper-minimizing States in a (Minimized) Deterministic Automaton , 2009, CIAA.