Given $S = \{a^n b^n \mid n > 0\}$, show $S$ is deterministically decidable in log space.Hint: to count up to $n$ you need $\log n$ bits.This comes from some lecture notes at https://www.cise.ufl.edu/research/OptimaNetSci/slides/ThangSept20.pdfbut they did not show how to prove it. Any ideas?  (Was posted in wrong section before)
Decide $\{a^nb^n\mid n>0\}$ in log space
complexity theory;decision problem;space complexity