S. Beier and M. Holzer, Decidability of right one-way jumping finite automata, Developments in Language Theory -22nd International Conference, vol.11088, pp.109-120, 2018.

S. Beier and M. Holzer, Properties of right one-way jumping finite automata, Descriptional Complexity of Formal Systems20th IFIP WG 1.02 International Conference, DCFS 2018, vol.10952, pp.11-23, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01905638

S. Beier, M. Holzer, and M. Kutrib, Operational state complexity and decidability of jumping finite automata, Developments in Language Theory -21st International Conference, vol.10396, pp.96-108, 2017.

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

H. Fernau, M. Paramasivan, and M. L. Schmid, Jumping finite automata: Characterizations and complexity, Implementation and Application of Automata -20th International Conference, CIAA 2015, vol.9223, pp.89-101, 2015.

H. Fernau, M. Paramasivan, M. L. Schmid, and V. Vorel, Characterization and complexity results on jumping finite automata, Theor. Comput. Sci, vol.679, pp.31-52, 2017.

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

R. Kocman and A. Meduna, On parallel versions of jumping finite automata, Advances in Intelligent Systems and Computing, pp.142-149, 2016.

Z. Krivka and A. Meduna, Jumping grammars, Int. J. Found. Comput. Sci, vol.26, issue.6, pp.709-732, 2015.

M. Latteux, Cônes rationnels commutatifs, J. Comput. Syst. Sci, vol.18, issue.3, pp.307-333, 1979.

G. Madejski, Jumping and pumping lemmas and their applications, Eighth Workshop on Non-Classical Models of Automata and Applications (NCMA 2016) Short papers, pp.25-33, 2016.

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

A. Meduna and P. Zemek, Regulated Grammars and Automata, 2014.

R. Parikh, On context-free languages, J. ACM, vol.13, issue.4, pp.570-581, 1966.

M. Sipser, Introduction to the Theory of Computation. Course Technology, second edn, 2006.

S. Yu, A pumping lemma for deterministic context-free languages, Inf. Process. Lett, vol.31, issue.1, pp.90108-90115, 1989.