VOLUME 24 2019 NUMBERS 2–4

Hardly Reachable Subsets and Completely Reachable Automata with 1-Deficient Words
François Gonze, Raphaël M. Jungers
Pages 321–342





Download Abstract
Fulltext is accessible with your personal account
ShowHide BibTeX
BibTeX:
@article{JALC-2019-321,
  author  = {Fran{\c{c}}ois Gonze and Rapha{\"{e}}l M.~Jungers},
  title   = {Hardly Reachable Subsets and Completely Reachable Automata with 1-Deficient Words},
  journal = {Journal of Automata, Languages and Combinatorics},
  volume  = {24},
  number  = {2--4},
  pages   = {321--342},
  year    = {2019},
  url     = {https://doi.org/10.25596/jalc-2019-321},
  doi     = {10.25596/jalc-2019-321}
}
If you would like to see an embedded preview, try to select preview as the action for Portable Document Format (PDF) in your brower settings.
Keywords: Γ₁-graph, subset reachability, short reaching word, completely reachable automata
DOI: 10.25596/jalc-2019-321