S. Beier, M. Holzer, and M. Kutrib, Operational state complexity and decidability of jumping finite automata, Proc. 21st DLT, number 10396 in LNCS, pp.96-108, 2017.

S. Bensch, H. Bordihn, M. Holzer, and M. Kutrib, On input-revolving deterministic and nondeterministic finite automata, Inform. Comput, vol.207, issue.11, pp.1140-1155, 2009.

H. Chigahara, S. Fazekas, and A. Yamamura, One-way jumping finite automata, Internat. J. Found. Comput. Sci, vol.27, issue.3, pp.391-405, 2016.

C. Culy, Formal properties of natural language and linguistic theories, Linguist. Philos, vol.19, pp.599-617, 1996.

L. E. Dickson, Finiteness of the odd perfect and primitive abundant numbers with n distinct prime factors, American J. Math, vol.35, issue.4, pp.413-422, 1913.

H. Fernau, M. Paramasivan, and M. L. Schmid, Jumping finite automata: Characterizations and compliexity, Proc. 20th CIAA, number 9223 in LNCS, pp.89-101, 2015.

H. Fernau, M. Paramasivan, M. L. Schmid, and V. Vorel, Characterization and complexity results on jumping finite automata, 2015.

S. Ginsburg and E. H. Spanier, Bounded ALGOL-like languages, Trans. AMS, vol.113, pp.333-368, 1964.
DOI : 10.2307/1994067

S. A. Greibach, An infinite hierarchy of context-free languages, J. ACM, vol.16, issue.1, pp.91-106, 1969.

J. E. Hopcroft and J. D. Ullman, Introduction to Automata Theory, Languages and Computation, 1979.

A. Meduna and P. Zemek, Jumping finite automata, Internat. J. Found. Comput. Sci, vol.23, issue.7, pp.1555-1578, 2012.

A. Meduna and P. Zemek, Regulated Grammars and Automata, Basic properties of jumping finite automata, vol.17, pp.567-585, 2014.