Guess-and-verify versus unrestricted nondeterminism for OBDDs and one-way Turing machines

Martin Sauerhoff. Guess-and-verify versus unrestricted nondeterminism for OBDDs and one-way Turing machines. J. Comput. Syst. Sci., 66(3):473-495, 2003. [doi]

@article{Sauerhoff03:0,
  title = {Guess-and-verify versus unrestricted nondeterminism for OBDDs and one-way Turing machines},
  author = {Martin Sauerhoff},
  year = {2003},
  doi = {10.1016/S0022-0000(03)00037-0},
  url = {http://dx.doi.org/10.1016/S0022-0000(03)00037-0},
  researchr = {https://researchr.org/publication/Sauerhoff03%3A0},
  cites = {0},
  citedby = {0},
  journal = {J. Comput. Syst. Sci.},
  volume = {66},
  number = {3},
  pages = {473-495},
}