scientific article; zbMATH DE number 7584600
From MaRDI portal
Publication:5867521
Palak Pandoh, Kalpana Mahalingam, Lila Kari, Zihao Wang
Publication date: 14 September 2022
Full work available at URL: http://www.jalc.de/issues/2022/issue_27_1-3/jalc-2022-151-178.php
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
DNA computingWatson-Crick complementarityantimorphic involutioninvolutive Fibonacci wordsatom Fibonacci words
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The equation \(a_ M=b^ Nc^ P\) in a free group
- On a special class of primitive words
- Sequences generated by infinitely iterated morphisms
- A generalization of automatic sequences
- A combinatorial property of the Fibonacci words
- Properties of Fibonacci languages
- Formal and natural computing. Essays dedicated to Grzegorz Rozenberg
- A generalization of the Fibonacci word fractal and the Fibonacci snowflake
- Balances of m-bonacci Words
- Decision algorithms for Fibonacci-automatic Words, I: Basic results
- Beatty Sequences, Continued Fractions, and Certain Shift Operators
- Fast Pattern Matching in Strings
- HAIRPIN LANGUAGES
- Derivatives of Regular Expressions
- BOND-FREE LANGUAGES: FORMALIZATIONS, MAXIMALITY AND CONSTRUCTION METHODS
- DNA Computing
- DNA Computing
This page was built for publication: