| Information | |
|---|---|
| has gloss | eng: In mathematics the Baum–Sweet sequence is an infinite automatic sequence of 0s and 1s defined by the rule: |
| lexicalization | eng: Baum-Sweet sequence |
| lexicalization | eng: Baum–Sweet sequence |
| instance of | c/Binary sequences |
Lexvo © 2008-2025 Gerard de Melo. Contact Legal Information / Imprint