Characterization and complexity results on jumping finite automata. Fernau, H., Paramasivan, M., Schmid, M. L., & Vorel, V. Theor. Comput. Sci., 679:31–52, 2017.
Characterization and complexity results on jumping finite automata [link]Paper  doi  bibtex   
@article{DBLP:journals/tcs/FernauPSV17,
  author    = {Henning Fernau and
               Meenakshi Paramasivan and
               Markus L. Schmid and
               Vojtech Vorel},
  title     = {Characterization and complexity results on jumping finite automata},
  journal   = {Theor. Comput. Sci.},
  volume    = {679},
  pages     = {31--52},
  year      = {2017},
  url       = {https://doi.org/10.1016/j.tcs.2016.07.006},
  doi       = {10.1016/j.tcs.2016.07.006},
  timestamp = {Thu, 28 Dec 2017 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/bib/journals/tcs/FernauPSV17},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

Downloads: 0