Journal article
On Sturmian and episturmian words, and related topics
Bulletin of the Australian Mathematical Society, Vol.74(01), pp.155-160
2006
Abstract
Combinatorics on words plays a fundamental role in various fields of mathematics, not to mention its relevance in theoretical computer science and physics. Most renowned among its branches is the theory of infinite binary sequences called Sturmian words, which are fascinating in many respects, having been studied from combinatorial, algebraic, and geometric points of view. The most well-known example of a Sturmian word is the ubiquitous Fibonacci word, the importance of which lies in combinatorial pattern matching and the theory of words. Properties of the Fibonacci word and, more generally, Sturmian words have been extensively studied, not only because of their significance in discrete mathematics, but also due to their practical applications in computer imagery (digital straightness), theoretical physics (quasicrystal modelling) and molecular biology.
Details
- Title
- On Sturmian and episturmian words, and related topics
- Authors/Creators
- A. Glen (Author/Creator)
- Publication Details
- Bulletin of the Australian Mathematical Society, Vol.74(01), pp.155-160
- Publisher
- Cambridge University Press
- Identifiers
- 991005542976807891
- Murdoch Affiliation
- Murdoch University
- Language
- English
- Resource Type
- Journal article
Metrics
348 File views/ downloads
57 Record Views
InCites Highlights
These are selected metrics from InCites Benchmarking & Analytics tool, related to this output
- Citation topics
- 9 Mathematics
- 9.28 Pure Maths
- 9.28.534 Dynamical Systems
- Web Of Science research areas
- Mathematics
- ESI research areas
- Mathematics