VOLUME 12 2007 NUMBERS 1–2

Deterministic Moles Cannot Solve Liveness
Christos A. Kapoutsis
Pages 215–235

Download Abstract
Fulltext is accessible with your personal account
ShowHide BibTeX
  author  = {Christos A. Kapoutsis},
  title   = {Deterministic Moles Cannot Solve Liveness},
  journal = {Journal of Automata, Languages and Combinatorics},
  volume  = {12},
  number  = {1--2},
  pages   = {215--235},
  year    = {2007},
  url     = {https://doi.org/10.25596/jalc-2007-215},
  doi     = {10.25596/jalc-2007-215}
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: one-way nondeterministic finite automata, two-way deterministic finite automata, Sakoda-Sipser conjecture, 2D versus 2N, descriptional complexity
DOI: 10.25596/jalc-2007-215