Each complexity-two word represents every sufficiently long spike.

DOI10.1007/PL00000341zbMath1058.20052OpenAlexW2076969633MaRDI 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 problemuniversal wordssemigroups of partial functions

Mathematics Subject Classification ID

Semigroups of transformations, relations, partitions, etc. (20M20) Word problems, etc. in computability and recursion theory (03D40)

This page was built for publication: Each complexity-two word represents every sufficiently long spike.