×

Found 228 Documents (Results 1–100)

Lyndon words and short superstrings. (English) Zbl 1422.68332

Khanna, Sanjeev (ed.), Proceedings of the 24th annual ACM-SIAM symposium on discrete algorithms, SODA 2013, New Orleans, LA, USA, January 6–8, 2013. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 958-972 (2013).
MSC:  68W32 68R15 68W25
PDFBibTeX XMLCite
Full Text: DOI arXiv

On the pseudoperiodic extension of \(u^\ell = v^m w^n\). (English) Zbl 1359.68242

Seth, Anil (ed.) et al., 33nd international conference on foundations of software technology and theoretical computer science, FSTTCS 2013, Guwahati, India, December 12–14, 2013. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-64-4). LIPIcs – Leibniz International Proceedings in Informatics 24, 475-486 (2013).
MSC:  68R15
PDFBibTeX XMLCite
Full Text: DOI

On infinite words determined by stack automata. (English) Zbl 1359.68179

Seth, Anil (ed.) et al., 33nd international conference on foundations of software technology and theoretical computer science, FSTTCS 2013, Guwahati, India, December 12–14, 2013. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-64-4). LIPIcs – Leibniz International Proceedings in Informatics 24, 413-424 (2013).
MSC:  68Q45 68R15
PDFBibTeX XMLCite
Full Text: DOI

Composition problems for braids. (English) Zbl 1359.68142

Seth, Anil (ed.) et al., 33nd international conference on foundations of software technology and theoretical computer science, FSTTCS 2013, Guwahati, India, December 12–14, 2013. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-64-4). LIPIcs – Leibniz International Proceedings in Informatics 24, 175-187 (2013).
PDFBibTeX XMLCite
Full Text: DOI

On the parameterised complexity of string morphism problems. (English) Zbl 1359.68128

Seth, Anil (ed.) et al., 33nd international conference on foundations of software technology and theoretical computer science, FSTTCS 2013, Guwahati, India, December 12–14, 2013. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-64-4). LIPIcs – Leibniz International Proceedings in Informatics 24, 55-66 (2013).
PDFBibTeX XMLCite
Full Text: DOI

Finding pseudo-repetitions. (English) Zbl 1354.68215

Portier, Natacha (ed.) et al., 30th international symposium on theoretical aspects of computer science, STACS’ 13, Kiel, Germany, February 27 – March 2, 2013. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-50-7). LIPIcs – Leibniz International Proceedings in Informatics 20, 257-268 (2013).
MSC:  68R15 68W32
PDFBibTeX XMLCite
Full Text: DOI

Fast algorithms for abelian periods in words and greatest common divisor queries. (English) Zbl 1354.68216

Portier, Natacha (ed.) et al., 30th international symposium on theoretical aspects of computer science, STACS’ 13, Kiel, Germany, February 27 – March 2, 2013. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-50-7). LIPIcs – Leibniz International Proceedings in Informatics 20, 245-256 (2013).
MSC:  68R15 68P05 68W32
PDFBibTeX XMLCite
Full Text: DOI

Are three squares impossible? (English) Zbl 1291.68309

Gruner, Stefan (ed.) et al., Formal aspects of computing. Essays dedicated to Derrick Kourie on the occasion of his 65th birthday. Aachen: Shaker Verlag (ISBN 978-3-8440-2068-7/pbk). Berichte aus der Informatik, 135-150 (2013).
MSC:  68R15
PDFBibTeX XMLCite

Singularities of extremal periodic strings. (English) Zbl 1291.68304

Gruner, Stefan (ed.) et al., Formal aspects of computing. Essays dedicated to Derrick Kourie on the occasion of his 65th birthday. Aachen: Shaker Verlag (ISBN 978-3-8440-2068-7/pbk). Berichte aus der Informatik, 125-133 (2013).
MSC:  68R15
PDFBibTeX XMLCite

Verifying an enhanced cover array in linear time. (English) Zbl 1291.68308

Gruner, Stefan (ed.) et al., Formal aspects of computing. Essays dedicated to Derrick Kourie on the occasion of his 65th birthday. Aachen: Shaker Verlag (ISBN 978-3-8440-2068-7/pbk). Berichte aus der Informatik, 111-123 (2013).
MSC:  68R15 68W32
PDFBibTeX XMLCite

Analyzing strings with ordered Lyndon-like structures. (English) Zbl 1291.68303

Gruner, Stefan (ed.) et al., Formal aspects of computing. Essays dedicated to Derrick Kourie on the occasion of his 65th birthday. Aachen: Shaker Verlag (ISBN 978-3-8440-2068-7/pbk). Berichte aus der Informatik, 95-110 (2013).
MSC:  68R15 68W32
PDFBibTeX XMLCite

Finding palindromes: variants and algorithms. (English) Zbl 1405.68264

Achten, Peter (ed.) et al., The beauty of functional code. Essays dedicated to Rinus Plasmeijer on the occasion of his 61st birthday. Berlin: Springer (ISBN 978-3-642-40354-5/pbk). Lecture Notes in Computer Science 8106. Lecture Notes in Artificial Intelligence, 258-272 (2013).
MSC:  68R15 68W32
PDFBibTeX XMLCite
Full Text: DOI

Counting words with Laguerre polynomials. (English) Zbl 1283.68279

Proceedings of the 25th international conference on formal power series and algebraic combinatorics, FPSAC 2013, Paris, France, June 24–28, 2013. Nancy: The Association. Discrete Mathematics & Theoretical Computer Science (DMTCS). Discrete Mathematics and Theoretical Computer Science. Proceedings, 1101-1112, electronic only (2013).
MSC:  68R15 33C45
PDFBibTeX XMLCite
Full Text: Link

The height of the Lyndon tree. (English) Zbl 1283.05058

Proceedings of the 25th international conference on formal power series and algebraic combinatorics, FPSAC 2013, Paris, France, June 24–28, 2013. Nancy: The Association. Discrete Mathematics & Theoretical Computer Science (DMTCS). Discrete Mathematics and Theoretical Computer Science. Proceedings, 957-968, electronic only (2013).
PDFBibTeX XMLCite
Full Text: Link

Counting strings over \(\mathbb Z2^d\) with given elementary symmetric function evaluations. (English) Zbl 1291.05010

Proceedings of the 25th international conference on formal power series and algebraic combinatorics, FPSAC 2013, Paris, France, June 24–28, 2013. Nancy: The Association. Discrete Mathematics & Theoretical Computer Science (DMTCS). Discrete Mathematics and Theoretical Computer Science. Proceedings, 897-908, electronic only (2013).
MSC:  05A15 11B50 68R15
PDFBibTeX XMLCite
Full Text: Link

Diagrams of affine permutations, balanced labellings, and affine Stanley symmetric functions (extended abstract). (English) Zbl 1294.05139

Proceedings of the 25th international conference on formal power series and algebraic combinatorics, FPSAC 2013, Paris, France, June 24–28, 2013. Nancy: The Association. Discrete Mathematics & Theoretical Computer Science (DMTCS). Discrete Mathematics and Theoretical Computer Science. Proceedings, 779-790, electronic only (2013).
PDFBibTeX XMLCite
Full Text: arXiv Link

Deciding representability of sets of words of equal length in polynomial time. (English) Zbl 1407.68380

Lecroq, Thierry (ed.) et al., Combinatorial algorithms. 24th international workshop, IWOCA 2013, Rouen, France, July 10–12, 2013. Revised selected papers. Berlin: Springer. Lect. Notes Comput. Sci. 8288, 28-40 (2013).
MSC:  68R15 68Q25 68R10
PDFBibTeX XMLCite
Full Text: DOI

Subexponential estimates in the height theorem and estimates on numbers of periodic parts of small periods. (English. Russian original) Zbl 1294.16014

J. Math. Sci., New York 193, No. 4, 493-515 (2013); translation from Fundam. Prikl. Mat. 17(2011/12), No. 5, 21-54 (2012).
PDFBibTeX XMLCite
Full Text: DOI

Filter Results by …

Document Type

Database

all top 5

Author

all top 5

Serial

all top 3

Main Field