109 citations
- Budapest University of Technology and EconomicsHU3 papers
- Eötvös Loránd UniversityHU3 papers
- Pázmány Péter Catholic UniversityHU3 papers
- Technical University of Cluj-NapocaRO3 papers
- University of SzegedHU3 papers
- Hungarian Academy of SciencesHU2 papers
- Universidad de MurciaES2 papers
- University of ReginaCA2 papers
- Vrije Universiteit BrusselBE2 papers
- California State University, FullertonUS1 paper
- Graz University of TechnologyAT1 paper
- HUN-REN Institute for Nuclear ResearchHU1 paper
Showing 2010 · cs.DMShow all
3 papers · 2 filters
cs.DM2010
Maximal Complexity of Finite Words
M-C. Anisiu, Z. Blazsik, Z. Kasa
The subword complexity of a finite word of length is a function which associates to each the number of all distinct subwords of having the length . We defin…
cs.DM2010★ 1 cited
Properties of palindromes in finite words
M-C. Anisiu, V. Anisiu, Z. Kasa
We present a method which displays all palindromes of a given length from De Bruijn words of a certain order, and also a recursive one which constructs all palindromes of length $n…
cs.DM2010★ 2 cited
On the d-complexity of strings
Zoltan Kasa
This paper deals with the complexity of strings, which play an important role in biology (nucleotid sequences), information theory and computer science. The d-complexity of a strin…