Primitivity of atom Watson-Crick Fibonacci words
From MaRDI portal
(Redirected from Primitivity of atom Watson-Crick Fibonacci words)
Recommendations
Cites work
- A combinatorial property of the Fibonacci words
- A generalization of automatic sequences
- A generalization of the Fibonacci word fractal and the Fibonacci snowflake
- Balances of m-bonacci Words
- Beatty Sequences, Continued Fractions, and Certain Shift Operators
- BOND-FREE LANGUAGES: FORMALIZATIONS, MAXIMALITY AND CONSTRUCTION METHODS
- Decision algorithms for Fibonacci-automatic words. I: Basic results.
- Derivatives of Regular Expressions
- DNA Computing
- DNA Computing
- Fast Pattern Matching in Strings
- Formal and natural computing. Essays dedicated to Grzegorz Rozenberg
- Hairpin languages
- scientific article; zbMATH DE number 3947643 (Why is no real title available?)
- scientific article; zbMATH DE number 36117 (Why is no real title available?)
- scientific article; zbMATH DE number 1236223 (Why is no real title available?)
- scientific article; zbMATH DE number 1953221 (Why is no real title available?)
- scientific article; zbMATH DE number 947583 (Why is no real title available?)
- scientific article; zbMATH DE number 1568800 (Why is no real title available?)
- scientific article; zbMATH DE number 2124023 (Why is no real title available?)
- scientific article; zbMATH DE number 778467 (Why is no real title available?)
- scientific article; zbMATH DE number 3303654 (Why is no real title available?)
- Involutive Fibonacci words
- On a special class of primitive words
- On the k-Fibonacci words
- Properties of Fibonacci languages
- Sequences generated by infinitely iterated morphisms
- The equation \(a_ M=b^ Nc^ P\) in a free group
This page was built for publication: Primitivity of atom Watson-Crick Fibonacci words
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5867521)
