The results of theorem 1 should be explained more

[rihardsk]

There is a large part (2/3) devoted to the presentation of p-adic numbers, something that I would believe UCNC conference attenders are familiar with. I would have expected the "4 -Results" part to be explained in more details for a best understanding of where advantages could be gained over probabilistic machines when using p-adic numbers. I admit that while I understand p-adic numbers, I don't understand the main "theorem 1" result. I would suggest the authors to give more room to the "4" section in the final version. Maybe a more detailed example of a run of the automata for the (2) case of theorem 1 would help.