Finite automata and arithmetic J.-P. Allouche 1 ∗

First Page		Document Content
Date: 2000-08-07 13:52:27 Sequence Thue–Morse sequence Baum–Sweet sequence Rudin–Shapiro sequence Monoid Mathematics Automata theory Automatic sequence		Finite automata and arithmetic J.-P. Allouche 1 ∗ Add to Reading List Source URL: www.mat.univie.ac.at Download Document from Source Website File Size: 210,23 KB Share Document on Facebook

	The Thue-Morse Sequence and How to Create An Endless Game of Chess ¨ ¨ J ORN S TEUDING (U NI W URZBURG DocID: 1gHCs - View Document
	In-Depth Coverage of the Icon Programming Language and Applications April 2001 Number 65 In this issue T-Sequence Collation ..................................... 1 DocID: 1apSE - View Document
	Aperiodic Subtraction Games Aviezri S. Fraenkel∗ Department of Computer Science and Applied Mathematics Weizmann Institute of Science Rehovot 76100, Israel Submitted: Apr 30, 2011; Accepted: Aug 1, 2011; Published: Aug DocID: 18tM6 - View Document
	Finite automata and arithmetic J.-P. Allouche 1 ∗ DocID: 15M56 - View Document
	XXXX, 1–19 © De Gruyter YYYY Subsequences of automatic sequences and uniform distribution DocID: 15IyA - View Document