1. D. Berend and Ch. Frougny, Computability by finite automata and Pisot bases, to appear.
2. Transductions and Context-Free Languages;Berstel,1979
3. Cônes rationnels et familles agréables de langages — Application au langage à compteur;Boasson,1971
4. On a decision method in restricted second order arithmetic;Büchi,1962
5. On a decision method in restricted second order arithmetic;Büchi,1990