scientific article; zbMATH DE number 1844170
From MaRDI portal
Publication:4784598
zbMATH Open1136.68302MaRDI QIDQ4784598FDOQ4784598
Authors: Alex Heinis 
Publication date: 11 December 2002
Title of this publication is not available (Why is that?)
Research exposition (monographs, survey articles) pertaining to computer science (68-02) Combinatorics on words (68R15) Automata sequences (11B85) Free semigroups, generators and relations, word problems (20M05)
Cited In (9)
- Arithmetical complexity of symmetric D0L words.
- Languages under substitutions and balanced words
- The complexity of Fibonacci-like kneading sequences
- Combinatoire de mots récurrents de complexitén+2
- Words whose complexity satisfies lim \(\frac{p(n)}{n} = 1\).
- A note on the Markov condition and central words
- An arithmetic approach for the computing with words paradigm
- On Markoff's property and Sturmian words
- An isolated point in the Heinis spectrum
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4784598)
