Each complexity-two word represents every sufficiently long spike.

DOI10.1007/PL00000341zbMath1058.20052MaRDI QIDQ1771874

John R. Isbell, Nereu E. Burin, Donald Silberger

Publication date: 19 April 2005

Published in: Algebra Universalis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/pl00000341

zbMATH Keywords

word problem; universal words; semigroups of partial functions

Mathematics Subject Classification ID

20M20: Semigroups of transformations, relations, partitions, etc.

03D40: Word problems, etc. in computability and recursion theory