×

Found 101 Documents (Results 1–100)

Constructing the bijective and the extended Burrows-Wheeler transform in linear time. (English) Zbl 07695993

Gawrychowski, Paweł (ed.) et al., 32nd annual symposium on combinatorial pattern matching, CPM 2021, Wrocław, Poland, July 5–7, 2021. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 191, Article 7, 16 p. (2021).
MSC:  68W32
PDFBibTeX XMLCite
Full Text: DOI arXiv

Palindromic subsequences in finite words. (English) Zbl 1425.68334

Martín-Vide, Carlos (ed.) et al., Language and automata theory and applications. 13th international conference, LATA 2019, St. Petersburg, Russia, March 26–29, 2019, Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11417, 460-468 (2019).
MSC:  68R15
PDFBibTeX XMLCite
Full Text: DOI arXiv

Invariance: a theoretical approach for coding sets of words modulo literal (anti)morphisms. (English) Zbl 1405.68267

Brlek, Srečko (ed.) et al., Combinatorics on words. 11th international conference, WORDS 2017, Montréal, QC, Canada, September 11–15, 2017. Proceedings. Cham: Springer (ISBN 978-3-319-66395-1/pbk; 978-3-319-66396-8/ebook). Lecture Notes in Computer Science 10432, 214-227 (2017).
MSC:  68R15 94A45
PDFBibTeX XMLCite
Full Text: DOI arXiv

Minimal forbidden factors of circular words. (English) Zbl 1405.68261

Brlek, Srečko (ed.) et al., Combinatorics on words. 11th international conference, WORDS 2017, Montréal, QC, Canada, September 11–15, 2017. Proceedings. Cham: Springer (ISBN 978-3-319-66395-1/pbk; 978-3-319-66396-8/ebook). Lecture Notes in Computer Science 10432, 36-48 (2017).
MSC:  68R15 68Q45
PDFBibTeX XMLCite
Full Text: DOI arXiv

Linear-time sequence comparison using minimal absent words & applications. (English) Zbl 1475.68467

Kranakis, Evangelos (ed.) et al., LATIN 2016: theoretical informatics. 12th Latin American symposium, Ensenada, Mexico, April 11–15, 2016. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 9644, 334-346 (2016).
MSC:  68W32
PDFBibTeX XMLCite
Full Text: DOI arXiv

Suffixes, conjugates and Lyndon words. (English) Zbl 1381.68230

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, 131-142 (2013).
MSC:  68R15
PDFBibTeX XMLCite
Full Text: DOI

Faster generation of shorthand universal cycles for permutations. (English) Zbl 1253.05008

Thai, My T. (ed.) et al., Computing and combinatorics. 16th annual international conference, COCOON 2010, Nha Trang, Vietnam, July 19–21, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-14030-3/pbk). Lecture Notes in Computer Science 6196, 298-307 (2010).
MSC:  05A05
PDFBibTeX XMLCite
Full Text: DOI

Hopcroft’s algorithm and cyclic automata. (English) Zbl 1163.68021

Martín-Vide, Carlos (ed.) et al., Language and automata theory and applications. Second international conference, LATA 2008, Tarragona, Spain, March 13–19, 2008. Revised papers. Berlin: Springer (ISBN 978-3-540-88281-7/pbk). Lecture Notes in Computer Science 5196, 172-183 (2008).
MSC:  68Q45 68Q25
PDFBibTeX XMLCite
Full Text: DOI

On critical exponents in fixed points of non-erasing morphisms. (English) Zbl 1227.68074

Ibarra, Oscar H. (ed.) et al., Developments in language theory. 10th international conference, DLT 2006, Santa Barbara, CA, USA, June 26–29, 2006. Proceedings. Berlin: Springer (ISBN 3-540-35428-X/pbk). Lecture Notes in Computer Science 4036, 280-291 (2006).
MSC:  68Q70 68R15
PDFBibTeX XMLCite
Full Text: DOI

Filter Results by …

Document Type

Database

all top 5

Author

all top 5

Year of Publication

all top 3

Main Field

all top 3

Software