A.H.M. Smeets, <a href="/A096270/b096270_1.txt">Table of n, a(n) for n = 0..20000</a>
A.H.M. Smeets, <a href="/A096270/b096270_1.txt">Table of n, a(n) for n = 0..20000</a>
reviewed
approved
proposed
reviewed
editing
proposed
From A.H.M. Smeets, Mar 27 2024: (Start)
This sequence is also the Post tag system ({0, 1}, {0 -> 10, 1 -> 110}, 1, 0), where the leading symbols are not deleted (as commonly done in those tags), i.e., the deletion number becomes a shifting number. This tag (obviously) grows forever.
In general a tag as defined by Emil Leon Post, is given by a 4-tuple (Sigma,AF,n,w0), where Sigma is some (nonempty) alphabet, AF is the associated function (sometimes also called set of production rules) AF: Sigma -> Sigma*, n is the deletion number and w0 the initial string. (End)
Emil L. Post, <a href="http://www.lib.ysu.am/articles_art/63062f3ed126193beb426becc0fbbe33.pdf">Formal reductions of the general combinatorial decision problem</a>, American Journal of Mathematics, Vol. 65, No. 2 (Apr., 1943), pp. 197-215.
proposed
editing
editing
proposed
Emil L. Post, <a href="http://www.lib.ysu.am/articles_art/63062f3ed126193beb426becc0fbbe33.pdf">Formal reductions of the general combinatorial decision problem</a>, American Journal of Mathematics, Vol. 65, No. 2 (Apr., 1943), pp. 197-215.
From A.H.M. Smeets, Mar 27 2024: (Start)
This sequence is also the Post tag system ({0, 1}, {0 -> 10, 1 -> 110}, 1, 0), where the leading symbols are not deleted (as commonly done in those tags), i.e., the deletion number becomes a shifting number. This tag (obviously) grows forever.
In general a tag as defined by Emil Leon Post, is given by a 4-tuple (Sigma,AF,n,w0), where Sigma is some (nonempty) alphabet, AF is the associated function (sometimes also called set of production rules) AF: Sigma -> Sigma*, n is the deletion number and w0 the initial string. (End)
proposed
editing
editing
proposed