R. J. Peter and . Asveld, An inefficient representation of the empty word, Memorandum Informatica 96-14, 1996.

C. Baiocchi, Three Small Universal Turing Machines, Proc. 3rd International Conference on Machines, Computations, pp.1-10, 2001.
DOI : 10.1007/3-540-45132-3_1

J. Cocke and M. Minsky, Universality of Tag Systems with P = 2, Journal of the ACM, vol.11, issue.1, pp.15-20, 1963.
DOI : 10.1145/321203.321206

M. Cook, Universality in elementary cellular automata, Complex Systems, vol.15, issue.1, pp.1-40, 2004.

B. Hayes, Theory and Practice, pp.21-28, 1986.
DOI : 10.5149/9780807887813_hayes.15

M. Margenstern, Frontier between decidability and undecidability: a survey, Theoretical Computer Science, vol.231, issue.2, pp.217-251, 2000.
DOI : 10.1016/S0304-3975(99)00102-4

S. J. Maslov and E. L. On, Post's 'Tag' problem. (russian), pp.5-56, 1964.

P. Michel, Busy beaver competition and Collatz-like problems, Archive for Mathematical Logic, vol.69, issue.4, pp.351-367, 1993.
DOI : 10.1007/BF01409968

M. Minsky, Recursive unsolvability of Post's problem of tag and other topics in the theory of Turing machines Size and structure of universal Turing machines using tag systems: a 4-symbol 7-state machine, Proceedings Symposia Pure Mathematics Finite and infinite machines Series in Automatic Computation, pp.437-455, 1961.

T. Neary, Small polynomial time universal Turing machines, Proceedings of MFCSIT 2006, pp.325-329, 2006.

T. Neary and D. Woods, Four Small Universal Turing Machines, Machines, Computations, and Universality. Fifth International Conference, pp.242-254, 2007.
DOI : 10.1007/978-3-540-74593-8_21
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.145.8958

D. Pager, The Categorization of Tag Systems in Terms of Decidability, Journal of the London Mathematical Society, vol.2, issue.Part_3, pp.473-480, 1970.
DOI : 10.1112/jlms/2.Part_3.473

L. Emil and . Post, Formal reductions of the general combinatorial decision problem Absolutely unsolvable problems and relatively undecidable propositions -account of an anticipation , The Undecidable. Basic papers on undecidable propositions, unsolvable problems and computable functions, American Journal of Mathematics, vol.6521, issue.2, pp.197-215, 1943.

T. Rádo, On non-computable functions, The Bell System Technical Journal 41, pp.877-884, 1962.

C. E. Shannon, A Mathematical Theory of Communication, Bell System Technical Journal, vol.27, issue.3, pp.379-423, 1948.
DOI : 10.1002/j.1538-7305.1948.tb01338.x

J. B. Shearer, Periods of strings (letter to the editor), American Scientist, vol.86, p.207, 1996.

H. Wang, Tag systems and lag systems, Mathematische Annalen, vol.4, issue.1, pp.65-74, 1963.
DOI : 10.1007/BF01343730

S. Watanabe, 5-Symbol 8-State and 5-Symbol 6-State Universal Turing Machines, Journal of the ACM, vol.8, issue.4, pp.476-483, 1961.
DOI : 10.1145/321088.321090

S. Wolfram, A New Kind of Science, Applied Mechanics Reviews, vol.56, issue.2, 2002.
DOI : 10.1115/1.1553433

D. Woods and T. Neary, Small semi-weakly universal Turing machines, Machines, Computations , and Universality [31] , On the time complexity of 2-tag systems and small universal Turing machines, Fifth International Conference, MCU 2007 Orléans Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science, pp.303-315, 2006.