×

Found 29 Documents (Results 1–29)

LPF computation revisited. (English) Zbl 1267.68170

Fiala, Jiří (ed.) et al., Combinatorial algorithms. 20th international workshop, IWOCA 2009, Hradec nad Moravicí, Czech Republic, June 28–July 2, 2009. Revised selected papers. Berlin: Springer (ISBN 978-3-642-10216-5/pbk). Lecture Notes in Computer Science 5874, 158-169 (2009).
MSC:  68R15
PDFBibTeX XMLCite
Full Text: DOI

Understanding maximal repetitions in strings. (English) Zbl 1259.68249

Albers, Susanne (ed.) et al., STACS 2008. 25th international symposium on theoretical aspects of computer science, Bordeaux, France, February 21–23, 2008. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-06-4). LIPIcs – Leibniz International Proceedings in Informatics 1, 11-16, electronic only (2008).
MSC:  68W32 68R15 68Q25
PDFBibTeX XMLCite
Full Text: DOI arXiv Link

Towards a solution to the “runs” conjecture. (English) Zbl 1143.68510

Ferragina, Paolo (ed.) et al., Combinatorial pattern matching. 19th annual symposium, CPM 2008, Pisa, Italy, June 18–20, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-69066-5/pbk). Lecture Notes in Computer Science 5029, 290-302 (2008).
MSC:  68R15
PDFBibTeX XMLCite
Full Text: DOI

Analysis of maximal repetitions in strings. (English) Zbl 1147.68864

Kučera, Luděk (ed.) et al., Mathematical foundations of computer science 2007. 32nd international symposium, MFCS 2007, Český Krumlov, Czech Republic, August 26–31, 2007. Proceedings. Berlin: Springer (ISBN 978-3-540-74455-9/pbk). Lecture Notes in Computer Science 4708, 465-476 (2007).
MSC:  68W05 68R15 68W40
PDFBibTeX XMLCite
Full Text: DOI

The Lempel-Ziv complexity of fixed points of morphisms. (English) Zbl 1132.68516

Královič, Rastislav (ed.) et al., Mathematical foundations of computer science 2006. 31st international symposium, MFCS 2006, Stará Lesná, Slovakia, August 28–September 1, 2006. Proceedings. Berlin: Springer (ISBN 3-540-37791-3/pbk). Lecture Notes in Computer Science 4162, 280-291 (2006).
MSC:  68R15 68Q15 68P30
PDFBibTeX XMLCite
Full Text: DOI

A generalization of repetition threshold. (English) Zbl 1097.68110

Fiala, Jiří(ed.) et al., Mathematical foundations of computer Science 2004. 29th international symposium, MFCS 2004, Prague, Czech Republic, August 22–27, 2004. Proceedings. Berlin: Springer (ISBN 3-540-22823-3/pbk). Lecture Notes in Computer Science 3153, 818-826 (2004).
MSC:  68R15
PDFBibTeX XMLCite
Full Text: DOI arXiv

Fine and Wilf’s theorem for any number of periods. (English) Zbl 1040.68074

Harju, Tero (ed.) et al., Proceedings of WORDS’03, the 4th international conference on combinatorics on words, Turku, Finland, September 10–13, 2003. Turku: Turku Centre for Computer Science (ISBN 952-12-1211-X/pbk). TUCS General Publication 27, 65-74 (2003).
MSC:  68R15
PDFBibTeX XMLCite

On disjunctivity, ultimate periodicity and ultimate identity of Păun-Salomaa self-reading sequences. (English) Zbl 1096.68692

Dassow, Jürgen (ed.) et al., Developments in language theory. II. At the crossroads of mathematics, computer science and biology. Papers from the conference held in Magdeburg, Germany, July 17–21, 1995. Singapore: World Scientific (ISBN 981-02-2682-9). 44-53 (1996).
MSC:  68R15
PDFBibTeX XMLCite

Filter Results by …

Document Type

all top 5

Year of Publication

Main Field