Properties of right one-way jumping finite automata, Proceedings of the 20th International Workshop on Descriptional Complexity of Formal Systems, pp.11-23, 2018. ,
URL : https://hal.archives-ouvertes.fr/hal-01905638
Semi-linear lattices and right one-way jumping finite automata (extended abstract), Proceedings of the 24th International Conference on Implementation and Application of Automata, 2019. ,
Operational state complexity and decidability of jumping finite automata, Proceedings of the 21st International Conference on Developments in Language Theory, pp.96-108, 2017. ,
One-way jumping finite automata. Internat, J. Found. Comput. Sci, vol.27, issue.3, pp.391-405, 2016. ,
Jumping finite automata: Characterizations and complexity, Proceedings of the 20th Conference on Implementation and Application of Automata, pp.89-101, 2015. ,
Characterization and complexity results on jumping finite automata, Theoret. Comput. Sci, vol.679, pp.31-52, 2017. ,
Introduction to Formal Language Theory, 1978. ,
Operational state complexity under Parikh equivalence, Proceedings of the 16th International Workshop on Descriptional Complexity of Formal Systems, pp.294-305, 2014. ,
Jumping finite automata, Internat. J. Found. Comput. Sci, vol.23, issue.7, pp.1555-1578, 2012. ,
Finite-state acceptors with translucent letters, 1st Workshop on AI Methods for Interdisciplinary Research in Language and Biology-BILC, pp.3-13, 2011. ,
On basic properties of jumping finite automata, Internat. J. Found. Comput. Sci, vol.29, issue.1, pp.1-16, 2018. ,
Petri nets and semilinear sets (extended abstract), Proceedings of the 13th International Colloquium on Theoretical Aspects of Computing, pp.25-29, 2016. ,