투에-모스 수열

수학노트
둘러보기로 가기 검색하러 가기

노트

위키데이터

말뭉치

  1. Some combinatorial properties of the special factors of the Thue–Morse sequence in a two-letter alphabet are considered.[1]
  2. mod m is a generalized Thue-Morse sequence.[2]
  3. For his proof he reinvented the Thue-Morse sequence.[2]
  4. Dekking shows that the constant obtained by interpreting this sequence as a binary expansion is transcendental; see also "The Ubiquitous Prouhet-Thue-Morse Sequence".[2]
  5. The first few steps of this procedure yield the strings 0 then 01, 0110, 01101001, 0110100110010110, and so on, which are prefixes of the Thue–Morse sequence.[3]
  6. The Thue–Morse sequence in the form given above, as a sequence of bits, can be defined recursively using the operation of bitwise negation.[3]
  7. In their book on the problem of fair division, Steven Brams and Alan Taylor invoked the Thue–Morse sequence but did not identify it as such.[3]
  8. They proved that, as the duelers’ hitting probability approaches zero, the firing sequence converges to the Thue–Morse sequence.[3]
  9. The Prouhet-Thue-Morse sequence appears to be somewhat ubiquitous, and we describe many of its apparently unrelated occurrences.[4]
  10. Using turtle geometry and polygon maps, we realize the Thue-Morse sequence as the limit of polygonal curves in the plane.[5]
  11. This is the first term of the quadratic equation, which is the Thue-Morse sequence with each term doubled up.[6]
  12. In fact, the following stronger statement is true: the Thue-Morse sequence does not contain any substrings of the form , where is the first symbol of .[6]
  13. Kindermann generates fractal music using the self-similarity of the Thue-Morse sequence.[6]
  14. Indeed, the Thue–Morse sequence is a uniformly recurrent word, i.e., every factor appears in an infinite number of places with bounded gaps.[7]
  15. Has anyone calculated the complexity function of the Thue-Morse sequence?[8]
  16. This is the part that recursively computes the Thue-Morse sequence.[9]
  17. Haskell complains that these expressions have infinite type and refuses to evaluate them, bit I think that if they were evaluated, they would correctly generate the Thue-Morse sequence.[9]
  18. The quasiperiodic photonic crystals (PCs) used in these hybrid structures are the Thue-Morse sequence, the best performing structure that we have found in the first part.[10]
  19. This is ideal for generating the Thue-Morse sequence, as one can just count up by incrementing a register, and then check the parity each time.[11]
  20. If the parity is even, the corresponding element in the Thue-Morse sequence is 0, if it is odd it is 1.[11]
  21. pgm generates & displays the Thue─Morse sequence up to the Nth term (inclusive).[11]
  22. The Thue-Morse sequence is an example of a cube-free sequence on two symbols (Morse and Hedlund 1944), i.e., it contains no substrings of the form , where is any Word.[12]

소스

  1. ↑ Some combinatorial properties of the Thue–Morse sequence and a problem in semigroups
  2. ↑ 2.0 2.1 2.2 A010060
  3. ↑ 3.0 3.1 3.2 3.3 Thue–Morse sequence
  4. ↑ The Ubiquitous Prouhet-Thue-Morse Sequence
  5. ↑ WHEN THUE-MORSE MEETS KOCH
  6. ↑ 6.0 6.1 6.2 Thue-Morse Sequence -- from Wolfram MathWorld
  7. ↑ Encyclopedia of Mathematics
  8. ↑ Complexity of Thue-Morse Sequence
  9. ↑ 9.0 9.1 Thue-Morse Sequence in one Line of Haskell
  10. ↑ Enhancement of Light Localization in Hybrid Thue-Morse/Periodic Photonic Crystals
  11. ↑ 11.0 11.1 11.2 Rosetta Code
  12. ↑ Thue-Morse Sequence

메타데이터

위키데이터

Spacy 패턴 목록

  • [{'LOWER': 'thue'}, {'OP': '*'}, {'LOWER': 'morse'}, {'LEMMA': 'sequence'}]
  • [{'LOWER': 'prohuet'}, {'OP': '*'}, {'LOWER': 'thue'}, {'OP': '*'}, {'LOWER': 'morse'}, {'LEMMA': 'sequence'}]
  • [{'LOWER': 'morse'}, {'OP': '*'}, {'LOWER': 'thue'}, {'LEMMA': 'sequence'}]
원본 주소 "https://wiki.mathnt.net/index.php?title=투에-모스_수열&oldid=51089"