13
I would like to prove (or disprove) the following conjecture:
Conjecture: a two counter automata (2CA) cannot decide the following language:
$L = \{ n \mid $ the ternary and binary representations of $n$ have both even length or odd length$\}$
A 2CA can easily check if the binary representatio...
