Universal terms of complexity three

DOI10.1007/BF02483116zbMATH Open0533.20036OpenAlexW2091908800MaRDI QIDQ789532FDOQ789532

Authors: Donald Silberger 

Publication date: 1980

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

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

Recommendations

• scientific article; zbMATH DE number 4197977
• Binary morphisms with stable suffix complexity
• scientific article; zbMATH DE number 3941436
• Each complexity-two word represents every sufficiently long spike.
• On a universal \(\Sigma \)-function over a tree

zbMATH Keywords

successor functionpoint universal wordpredecessor function

Mathematics Subject Classification ID

Semigroups of transformations, relations, partitions, etc. (20M20) Other classical set theory (including functions, relations, and set algebra) (03E20) Word problems (aspects of algebraic structures) (08A50)

Cites Work

• Title not available (Why is that?)

Cited In (4)

• Some problems on the universality of words in groups
• The reverse spelling of an FPrt-universal word in two letters
• Some Universal Sets of Terms
• \(B^n A^m\) is universal iff point universal

This page was built for publication: Universal terms of complexity three

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