Each complexity-two word represents every sufficiently long spike.

DOI10.1007/PL00000341MaRDI QIDQ1771874zbMATH OpenOpenAlexFDO

Authors Nereu E. Burin, J. R. Isbell, 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)

Recommendations

• Compositions de fonctions de commutation partielle
• The reverse spelling of an FPrt-universal word in two letters
• Partial unary operations with long pre-periods
• scientific article; zbMATH DE number 2155203
• scientific article; zbMATH DE number 1444029

Cited in

(1)

• Universal terms of complexity three

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1771874)