VOLUME 14 2009 NUMBER 1

A Technique for Proving Lower Bounds on the Size of Sweeping Automata
Hing Leung
Pages 93–105





Download Abstract
Fulltext is accessible with your personal account
ShowHide BibTeX
BibTeX:
@article{JALC-2009-093,
  author  = {Hing Leung},
  title   = {A Technique for Proving Lower Bounds on the Size of Sweeping Automata},
  journal = {Journal of Automata, Languages and Combinatorics},
  volume  = {14},
  number  = {1},
  pages   = {93--105},
  year    = {2009},
  url     = {https://doi.org/10.25596/jalc-2009-093},
  doi     = {10.25596/jalc-2009-093}
}
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: deterministic finite automata, nondeterministic finite automata, two-way finite automata, sweeping automata, descriptional complexity
DOI: 10.25596/jalc-2009-093