login

Revision History for A096270

(Bold, blue-underlined text is an addition; faded, red-underlined text is a deletion.)

Showing entries 1-10 | older changes
Fixed point of the morphism 0->01, 1->011.
(history; published version)
#85 by OEIS Server at Thu Mar 28 21:55:49 EDT 2024
LINKS

A.H.M. Smeets, <a href="/A096270/b096270_1.txt">Table of n, a(n) for n = 0..20000</a>

#84 by Michael De Vlieger at Thu Mar 28 21:55:49 EDT 2024
STATUS

reviewed

approved

Discussion
Thu Mar 28
21:55
OEIS Server: Installed first b-file as b096270.txt.
#83 by Kevin Ryde at Thu Mar 28 19:58:31 EDT 2024
STATUS

proposed

reviewed

#82 by Kevin Ryde at Thu Mar 28 19:58:07 EDT 2024
STATUS

editing

proposed

#81 by Kevin Ryde at Thu Mar 28 19:52:57 EDT 2024
COMMENTS

From A.H.M. Smeets, Mar 27 2024: (Start)

Discussion
Thu Mar 28
19:58
Kevin Ryde: Repeats the morphism definition but backwards, departs from tag system by not doing the delete which is the nature of tag systems.  Nothing in comment about decidability.
#80 by Kevin Ryde at Thu Mar 28 19:52:28 EDT 2024
COMMENTS

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)

LINKS

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.

STATUS

proposed

editing

#79 by A.H.M. Smeets at Wed Mar 27 22:04:30 EDT 2024
STATUS

editing

proposed

Discussion
Wed Mar 27
22:09
A.H.M. Smeets: @Kevin Ryde: Note that in the Post tag system, the rhs strings in the production rules are the reverse strings of the strings mentioned in the rhs of the production rules in the namng. The same is observed in A003849.
Thu Mar 28
01:31
Kevin Ryde: In my view this tag system adds nothing to what the NAME says, and should not be entered.  Would literally every morphism sequence have a repeat of its definition but backwards, and a partial definition of what a Post system is?
12:06
A.H.M. Smeets: r@ Kevin Ryde: Post's tags are important in decidability theory.
#78 by A.H.M. Smeets at Wed Mar 27 22:01:15 EDT 2024
LINKS

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.

#77 by A.H.M. Smeets at Wed Mar 27 21:59:48 EDT 2024
COMMENTS

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)

STATUS

proposed

editing

#76 by A.H.M. Smeets at Wed Mar 27 21:48:06 EDT 2024
STATUS

editing

proposed