VOLUME 7 2002 NUMBER 3

A Leaf-Size Hierarchy of Alternating Rebound Turing Machines
Lan Zhang, Katsushi Inoue, Akira Ito, Yue Wang
Pages 395–410





Download Abstract
Fulltext is accessible with your personal account
ShowHide BibTeX
BibTeX:
@article{JALC-2002-395,
  author  = {Lan Zhang and Katsushi Inoue and Akira Ito and Yue Wang},
  title   = {A Leaf-Size Hierarchy of Alternating Rebound Turing Machines},
  journal = {Journal of Automata, Languages and Combinatorics},
  volume  = {7},
  number  = {3},
  pages   = {395--410},
  year    = {2002},
  url     = {https://doi.org/10.25596/jalc-2002-395},
  doi     = {10.25596/jalc-2002-395}
}
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: alternating rebound Turing machine, rebound automaton, computational complexity, leaf-size hierarchy
DOI: 10.25596/jalc-2002-395