×

Found 101 Documents (Results 1–100)

Constructing words with high distinct square densities. (English) Zbl 1483.68269

Csuhaj-Varjú, Erzsébet (ed.) et al., Proceedings of the 15th international conference on automata and formal languages, AFL’17, Debrecen, Hungary, September 4–6, 2017. Waterloo: Open Publishing Association (OPA). Electron. Proc. Theor. Comput. Sci. (EPTCS) 252, 71-85 (2017).
MSC:  68R15
PDFBibTeX XMLCite
Full Text: arXiv Link

Dyck words, lattice paths, and abelian borders. (English) Zbl 1485.68203

Csuhaj-Varjú, Erzsébet (ed.) et al., Proceedings of the 15th international conference on automata and formal languages, AFL’17, Debrecen, Hungary, September 4–6, 2017. Waterloo: Open Publishing Association (OPA). Electron. Proc. Theor. Comput. Sci. (EPTCS) 252, 56-70 (2017).
MSC:  68R15
PDFBibTeX XMLCite
Full Text: arXiv Link

Unavoidable sets of partial words of uniform length. (English) Zbl 1483.68268

Csuhaj-Varjú, Erzsébet (ed.) et al., Proceedings of the 15th international conference on automata and formal languages, AFL’17, Debrecen, Hungary, September 4–6, 2017. Waterloo: Open Publishing Association (OPA). Electron. Proc. Theor. Comput. Sci. (EPTCS) 252, 26-40 (2017).
MSC:  68R15
PDFBibTeX XMLCite
Full Text: arXiv Link

Longest common extensions in partial words. (English) Zbl 1393.68137

Lipták, Zsuzsanna (ed.) et al., Combinatorial algorithms. 26th international workshop, IWOCA 2015, Verona, Italy, October 5–7, 2015. Revised selected papers. Cham: Springer (ISBN 978-3-319-29515-2/pbk; 978-3-319-29516-9/ebook). Lecture Notes in Computer Science 9538, 52-64 (2016).
MSC:  68R15 68W32
PDFBibTeX XMLCite
Full Text: DOI

Computing primitively-rooted squares and runs in partial words. (English) Zbl 1380.68319

Kratochvíl, Jan (ed.) et al., Combinatorial algorithms. 25th international workshop, IWOCA 2014, Duluth, MN, USA, October 15–17, 2014. Revised selected papers. Cham: Springer (ISBN 978-3-319-19314-4/pbk; 978-3-319-19315-1/ebook). Lecture Notes in Computer Science 8986, 86-97 (2015).
MSC:  68R15 68W32
PDFBibTeX XMLCite
Full Text: DOI

Computing minimum length representations of sets of words of uniform length. (English) Zbl 1396.68082

Kratochvíl, Jan (ed.) et al., Combinatorial algorithms. 25th international workshop, IWOCA 2014, Duluth, MN, USA, October 15–17, 2014. Revised selected papers. Cham: Springer (ISBN 978-3-319-19314-4/pbk; 978-3-319-19315-1/ebook). Lecture Notes in Computer Science 8986, 74-85 (2015).
MSC:  68R15 68W32 68R10
PDFBibTeX XMLCite
Full Text: DOI

Border correlations, lattices, and the subgraph component polynomial. (English) Zbl 1396.05004

Kratochvíl, Jan (ed.) et al., Combinatorial algorithms. 25th international workshop, IWOCA 2014, Duluth, MN, USA, October 15–17, 2014. Revised selected papers. Cham: Springer (ISBN 978-3-319-19314-4/pbk; 978-3-319-19315-1/ebook). Lecture Notes in Computer Science 8986, 62-73 (2015).
MSC:  05A05 68R15
PDFBibTeX XMLCite
Full Text: DOI

New bounds and extended relations between prefix arrays, border arrays, undirected graphs, and indeterminate strings. (English) Zbl 1359.68238

Mayr, Ernst W. (ed.) et al., 31st international symposium on theoretical aspects of computer science, STACS’ 14, Lyon, France, March 5–8, 2014. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-65-1). LIPIcs – Leibniz International Proceedings in Informatics 25, 162-173 (2014).
MSC:  68R15 05C69
PDFBibTeX XMLCite
Full Text: DOI

Computing depths of patterns. (English) Zbl 1407.68379

Dediu, Adrian-Horia (ed.) et al., Language and automata theory and applications. 8th international conference, LATA 2014, Madrid, Spain, March 10–14, 2014. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 8370, 173-185 (2014).
MSC:  68R15
PDFBibTeX XMLCite
Full Text: DOI

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

Strict bounds for pattern avoidance. (English) Zbl 1381.68229

Béal, Marie-Pierre (ed.) et al., Developments in language theory. 17th international conference, DLT 2013, Marne-la-Vallée, France, June 18–21, 2013. Proceedings. Berlin: Springer (ISBN 978-3-642-38770-8/pbk). Lecture Notes in Computer Science 7907, 106-117 (2013).
MSC:  68R15
PDFBibTeX XMLCite
Full Text: DOI Link

On the asymptotic abelian complexity of morphic words. (English) Zbl 1381.68228

Béal, Marie-Pierre (ed.) et al., Developments in language theory. 17th international conference, DLT 2013, Marne-la-Vallée, France, June 18–21, 2013. Proceedings. Berlin: Springer (ISBN 978-3-642-38770-8/pbk). Lecture Notes in Computer Science 7907, 94-105 (2013).
MSC:  68R15
PDFBibTeX XMLCite
Full Text: DOI

Suffix trees for partial words and the longest common compatible prefix problem. (English) Zbl 1377.68326

Dediu, Adrian-Horia (ed.) et al., Language and automata theory and applications. 7th international conference, LATA 2013, Bilbao, Spain, April 2–5, 2013. Proceedings. Berlin: Springer (ISBN 978-3-642-37063-2/pbk). Lecture Notes in Computer Science 7810, 165-176 (2013).
MSC:  68W32 68P05 68R15
PDFBibTeX XMLCite
Full Text: DOI

A graph polynomial approach to primitivity. (English) Zbl 1377.68190

Dediu, Adrian-Horia (ed.) et al., Language and automata theory and applications. 7th international conference, LATA 2013, Bilbao, Spain, April 2–5, 2013. Proceedings. Berlin: Springer (ISBN 978-3-642-37063-2/pbk). Lecture Notes in Computer Science 7810, 153-164 (2013).
MSC:  68R15 05C31
PDFBibTeX XMLCite
Full Text: DOI

Computing the partial word avoidability indices of ternary patterns. (English) Zbl 1293.68208

Arumugam, S. (ed.) et al., Combinatorial algorithms. 23rd international workshop, IWOCA 2012, Tamil Nadu, India, July 19–21, 2012. Revised selected papers. Berlin: Springer (ISBN 978-3-642-35925-5/pbk). Lecture Notes in Computer Science 7643, 206-218 (2012).
MSC:  68R15
PDFBibTeX XMLCite
Full Text: DOI Link

Deciding representability of sets of words of equal length. (English) Zbl 1304.68141

Kutrib, Martin (ed.) et al., Descriptional complexity of formal systems. 14th international workshop, DCFS 2012, Braga, Portugal, July 23–25, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-31622-7/pbk). Lecture Notes in Computer Science 7386, 103-116 (2012).
MSC:  68R15
PDFBibTeX XMLCite
Full Text: DOI

Squares in binary partial words. (English) Zbl 1370.68240

Yen, Hsu-Chun (ed.) et al., Developments in language theory. 16th international conference, DLT 2012, Taipei, Taiwan, August 14–17, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-31652-4/pbk). Lecture Notes in Computer Science 7410, 404-415 (2012).
MSC:  68R15
PDFBibTeX XMLCite
Full Text: DOI

Abelian pattern avoidance in partial words. (English) Zbl 1365.68361

Rovan, Branislav (ed.) et al., Mathematical foundations of computer science 2012. 37th international symposium, MFCS 2012, Bratislava, Slovakia, August 27–31, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-32588-5/pbk). Lecture Notes in Computer Science 7464, 210-221 (2012).
MSC:  68R15
PDFBibTeX XMLCite
Full Text: DOI Numdam

On operations preserving primitivity of partial words with one hole. (English) Zbl 1341.68141

Dömösi, Pál (ed.) et al., Automata and formal languages. 13th international conference, AFL 2011, Debrecen, Hungary, August 17–22, 2011. Nyíregyháza: College of Nyíregyháza, Institute of Mathematics and Informatics (ISBN 978-615-5097-19-5/pbk). 93-107 (2011).
MSC:  68R15
PDFBibTeX XMLCite

Open problems on avoidable patterns in partial words. (English) Zbl 1341.68140

Dömösi, Pál (ed.) et al., Automata and formal languages. 13th international conference, AFL 2011, Debrecen, Hungary, August 17–22, 2011. Nyíregyháza: College of Nyíregyháza, Institute of Mathematics and Informatics (ISBN 978-615-5097-19-5/pbk). 12-24 (2011).
MSC:  68R15
PDFBibTeX XMLCite

Recurrent partial words. (English) Zbl 1331.68164

Ambrož, Petr (ed.) et al., Proceedings of the 8th international conference, Words 2011, Prague, Czech Republic, September, 12–16, 2011. Sydney: NICTA. Electronic Proceedings in Theoretical Computer Science 63, 71-82 (2011).
MSC:  68R15
PDFBibTeX XMLCite
Full Text: DOI arXiv EMIS

On minimal Sturmian partial words. (English) Zbl 1230.68123

Schwentick, Thomas (ed.) et al., STACS 2011. 28th international symposium on theoretical aspects of computer science, Dortmund, Germany, March 10–12, 2011. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-25-5). LIPIcs – Leibniz International Proceedings in Informatics 9, 225-236, electronic only (2011).
MSC:  68Q45 68R15 68R10
PDFBibTeX XMLCite
Full Text: DOI Link

Periods in partial words: an algorithm. (English) Zbl 1314.68247

Iliopoulos, Costas S. (ed.) et al., Combinatorial algorithms. 22nd international workshop, IWOCA 2011, Victoria, BC, Canada, July 20–22, 2011. Revised selected papers. Berlin: Springer (ISBN 978-3-642-25010-1/pbk). Lecture Notes in Computer Science 7056, 57-70 (2011).
MSC:  68R15 68Q45 68R10
PDFBibTeX XMLCite
Full Text: DOI Link

Avoiding abelian powers in partial words. (English) Zbl 1221.68177

Mauri, Giancarlo (ed.) et al., Developments in language theory. 15th international conference, DLT 2011, Milan, Italy, July 19–22, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-22320-4/pbk). Lecture Notes in Computer Science 6795, 70-81 (2011).
MSC:  68R15
PDFBibTeX XMLCite
Full Text: DOI

Classifying all avoidable sets of partial words of size two. (English) Zbl 1228.68041

Martín-Vide, Carlos (ed.), Scientific applications of language methods. London: Imperial College Press (ISBN 978-1-84816-544-1/hbk; 978-1-84816-545-8/ebook). Mathematics, Computing, Language, and Life: Frontiers in Mathematical Linguistics and Language Theory 2, 59-101 (2011).
MSC:  68R15 05C25
PDFBibTeX XMLCite

Unary pattern avoidance in partial words dense with holes. (English) Zbl 1330.68232

Dediu, Adrian-Horia (ed.) et al., Language and automata theory and applications. 5th international conference, LATA 2011, Tarragona, Spain, May 26–31, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-21253-6/pbk). Lecture Notes in Computer Science 6638, 155-166 (2011).
MSC:  68R15
PDFBibTeX XMLCite
Full Text: DOI

Minimum number of holes in unavoidable sets of partial words of size three. (English) Zbl 1232.68096

Iliopoulos, Costas S. (ed.) et al., Combinatorial algorithms. 21st international workshop, IWOCA 2010, London, UK, July 26–28, 2010. Revised selected papers. Berlin: Springer (ISBN 978-3-642-19221-0/pbk). Lecture Notes in Computer Science 6460, 43-55 (2011).
MSC:  68R15
PDFBibTeX XMLCite
Full Text: DOI

Binary de Bruijn partial words with one hole. (English) Zbl 1284.68482

Kratochvíl, Jan (ed.) et al., Theory and applications of models of computation. 7th annual conference, TAMC 2010, Prague, Czech Republic, June 7–11, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-13561-3/pbk). Lecture Notes in Computer Science 6108, 128-138 (2010).
MSC:  68R15
PDFBibTeX XMLCite
Full Text: DOI

Avoidable binary patterns in partial words. (English) Zbl 1284.68481

Dediu, Adrian-Horia (ed.) et al., Language and automata theory and applications. 4th international conference, LATA 2010, Trier, Germany, May 24–28, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-13088-5/pbk). Lecture Notes in Computer Science 6031, 106-117 (2010).
MSC:  68R15
PDFBibTeX XMLCite
Full Text: DOI

Abelian square-free partial words. (English) Zbl 1284.68480

Dediu, Adrian-Horia (ed.) et al., Language and automata theory and applications. 4th international conference, LATA 2010, Trier, Germany, May 24–28, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-13088-5/pbk). Lecture Notes in Computer Science 6031, 94-105 (2010).
MSC:  68R15
PDFBibTeX XMLCite
Full Text: DOI

How many holes can an unbordered partial word contain? (English) Zbl 1234.68327

Dediu, Adrian Horia (ed.) et al., Language and automata theory and applications. Third international conference, LATA 2009, Tarragona, Spain, April 2–8, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-00981-5/pbk). Lecture Notes in Computer Science 5457, 176-187 (2009).
MSC:  68R15
PDFBibTeX XMLCite
Full Text: DOI

Two element unavoidable sets of partial words. (English) Zbl 1202.68294

Harju, Tero (ed.) et al., Developments in language theory. 11th international conference, DLT 2007, Turku, Finland, July 3–6, 2007. Proceedings. Berlin: Springer (ISBN 978-3-540-73207-5/pbk). Lecture Notes in Computer Science 4588, 96-107 (2007).
MSC:  68R15
PDFBibTeX XMLCite
Full Text: DOI

Correlations of partial words. (English) Zbl 1186.68344

Thomas, Wolfgang (ed.) et al., STACS 2007. 24th annual symposium on theoretical aspects of computer science, Aachen, Germany, February 22–24, 2007. Proceedings. Berlin: Springer (ISBN 978-3-540-70917-6/pbk). Lecture Notes in Computer Science 4393, 97-108 (2007).
MSC:  68R15 68Q45
PDFBibTeX XMLCite
Full Text: DOI

Equations on partial words. (English) Zbl 1132.68513

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, 167-178 (2006).
MSC:  68R15 68Q45
PDFBibTeX XMLCite
Full Text: DOI

Filter Results by …

Document Type

all top 5

Author

all top 5

Year of Publication

all top 3

Main Field