WORDS - researchr conference series publications

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 100 from 134

2023

Longest Common Subsequence with Gap ConstraintsDuncan Adamson, Maria Kosche, Tore Koß, Florin Manea, Stefan Siemer. cwords 2023: 60-76 [doi]

Ranking and Unranking k-Subsequence Universal WordsDuncan Adamson. cwords 2023: 47-59 [doi]

Minimal Complexities for Infinite Words Written with d LettersMélodie Andrieu, Léo Vivion. cwords 2023: 3-13 [doi]

On Substitutions Preserving Their Return SetsValérie Berthé, Herman Goulet-Ouellet. cwords 2023: 77-90 [doi]

Recurrence and FrequenciesValérie Berthé, Ahmed Mimouni. cwords 2023: 91-103 [doi]

On the Number of Distinct Squares in Finite Sequences: Some Old and New ResultsSrecko Brlek, Shuo Li. cwords 2023: 35-44 [doi]

Sturmian and Infinitely Desubstitutable Words Accepted by an ømega-AutomatonPierre Béaur, Benjamin Hellouin de Menibus. cwords 2023: 104-116 [doi]

String Attractors for Factors of the Thue-Morse WordFrancesco Dolce. cwords 2023: 117-129 [doi]

On a Class of 2-Balanced SequencesL'ubomíra Dvoráková, Martin Masek, Edita Pelantová. cwords 2023: 143-154 [doi]

Critical Exponents of Regular Arnoux-Rauzy SequencesL'ubomíra Dvoráková, Jana Lepsová. cwords 2023: 130-142 [doi]

Order Conditions for LanguagesSébastien Ferenczi, Pascal Hubert, Luca Q. Zamboni. cwords 2023: 155-167 [doi]

Combinatorics on Words - 14th International Conference, WORDS 2023, Umeå, Sweden, June 12-16, 2023, ProceedingsAnna E. Frid, Robert Mercas, editors, Volume 13899 of Lecture Notes in Computer Science, Springer, 2023. [doi]

On Sensitivity of Compact Directed Acyclic Word GraphsHiroto Fujimaru, Yuto Nakashima, Shunsuke Inenaga. cwords 2023: 168-180 [doi]

Smallest and Largest Block Palindrome FactorizationsDaniel Gabric, Jeffrey O. Shallit. cwords 2023: 181-191 [doi]

String Attractors of Fixed Points of k-Bonacci-Like MorphismsFrance Gheeraert, Giuseppe Romana, Manon Stipulanti. cwords 2023: 192-205 [doi]

Magic Numbers in Periodic SequencesSavinien Kreczman, Luca Prigioniero, Eric Rowland, Manon Stipulanti. cwords 2023: 206-219 [doi]

Dyck Words, Pattern Avoidance, and Automatic SequencesLucas Mol, Narad Rampersad, Jeffrey O. Shallit. cwords 2023: 220-232 [doi]

Rudin-Shapiro Sums via Automata Theory and LogicNarad Rampersad, Jeffrey O. Shallit. cwords 2023: 233-246 [doi]

Automaticity and Parikh-Collinear MorphismsMichel Rigo, Manon Stipulanti, Markus A. Whiteland. cwords 2023: 247-260 [doi]

On the Solution Sets of Entire Systems of Word EquationsAleksi Saarela. cwords 2023: 261-273 [doi]

On Arch Factorization and Subword Universality for Words and Compressed WordsPhilippe Schnoebelen, Julien Veron. cwords 2023: 274-287 [doi]

Characteristic Sequences of the Sets of Sums of Squares as Columns of Cellular AutomataPierre-Adrien Tahay. cwords 2023: 288-300 [doi]

Alternate Base Numeration SystemsÉmilie Charlier. cwords 2023: 14-34 [doi]

2021

A Numeration System for Fibonacci-Like Wang ShiftsSébastien Labbé 0001, Jana Lepsová. cwords 2021: 104-116 [doi]

Quaternary n-cubes and Isometric WordsMarcella Anselmo, Manuela Flores, Maria Madonia. cwords 2021: 27-39 [doi]

Strings from Linear Recurrences: A Gray CodeElena Barcucci, Antonio Bernini, Renzo Pinzani. cwords 2021: 40-49 [doi]

String Theories Involving Regular Membership Predicates: From Practice to Theory and BackMurphy Berzish, Joel D. Day, Vijay Ganesh, Mitja Kulczynski, Florin Manea, Federico Mora, Dirk Nowotka. cwords 2021: 50-64 [doi]

Binary Cyclotomic Polynomials: Representation via Words and AlgorithmsAntonio Cafure, Eda Cesaratto. cwords 2021: 65-77 [doi]

Computation of Critical Exponent in Balanced SequencesFrancesco Dolce, L'ubomíra Dvoráková, Edita Pelantová. cwords 2021: 78-90 [doi]

The Range Automaton: An Efficient Approach to Text-SearchingSimone Faro, Stefano Scafiti. cwords 2021: 91-103 [doi]

Perfectly Clustering Words are Primitive Positive Elements of the Free GroupMélodie Lapointe. cwords 2021: 117-128 [doi]

Combinatorics on Words - 13th International Conference, WORDS 2021, Rouen, France, September 13-17, 2021, ProceedingsThierry Lecroq, Svetlana Puzynina, editors, Volume 12847 of Lecture Notes in Computer Science, Springer, 2021. [doi]

On Billaud Words and Their CompanionsSzymon Lopaciuk, Daniel Reidenbach. cwords 2021: 129-141 [doi]

Counting Ternary Square-Free Words QuicklyVladislav Makarov. cwords 2021: 142-152 [doi]

Doubled Patterns with Reversal Are 3-AvoidablePascal Ochem. cwords 2021: 153-159 [doi]

Continuants with Equal Values, a Combinatorial ApproachGerhard Ramharter, Luca Q. Zamboni. cwords 2021: 20-26 [doi]

A Characterization of Binary Morphisms Generating Lyndon Infinite WordsGwénaël Richomme, Patrice Séébold. cwords 2021: 160-171 [doi]

Inside the Binary Reflected Gray Code: Flip-Swap Languages in 2-Gray Code OrderJoe Sawada, Aaron Williams, Dennis Wong. cwords 2021: 172-184 [doi]

Synchronized SequencesJeffrey O. Shallit. cwords 2021: 1-19 [doi]

Equations over the k-Binomial MonoidsMarkus A. Whiteland. cwords 2021: 185-197 [doi]

2019

Parikh DeterminantsAdrian Atanasiu, Ghajendran Poovanandran, Wen Chean Teh. cwords 2019: 68-79 [doi]

Repetitions in Infinite Palindrome-Rich WordsAseem R. Baranwal, Jeffrey Shallit. cwords 2019: 93-105 [doi]

Critical Exponent of Infinite Balanced Words via the Pell Number SystemAseem R. Baranwal, Jeffrey Shallit. cwords 2019: 80-92 [doi]

Generalized Lyndon Factorizations of Infinite WordsAmanda Burcroff, Eric Winsor. cwords 2019: 106-118 [doi]

On the Commutative Equivalence of Bounded Semi-linear CodesArturo Carpi, Flavio D'Alessandro. cwords 2019: 119-132 [doi]

On Sets of Words of Rank TwoGiuseppa Castiglione, Gabriele Fici, Antonio Restivo. cwords 2019: 46-59 [doi]

Circularly Squarefree Words and Unbordered Conjugates: A New ApproachTrevor Clokie, Daniel Gabric, Jeffrey Shallit. cwords 2019: 133-144 [doi]

The Undirected Repetition ThresholdJames D. Currie, Lucas Mol. cwords 2019: 145-158 [doi]

Characteristic Parameters and Special Trapezoidal WordsAlma D'Aniello, Alessandro De Luca 0002. cwords 2019: 159-166 [doi]

Return Words and Bifix Codes in Eventually Dendric SetsFrancesco Dolce, Dominique Perrin. cwords 2019: 167-179 [doi]

Enumeration and Extensions of Word-RepresentantsMarisa R. Gaetz, Caleb Ji. cwords 2019: 180-192 [doi]

Localisation-Resistant Random Words with Small AlphabetsCyril Gavoille, Ghazal Kachigar, Gilles Zémor. cwords 2019: 193-206 [doi]

On Codeword Lengths Guaranteeing SynchronizationVladimir V. Gusev, Elena V. Pribavkina. cwords 2019: 207-216 [doi]

Binary Intersection RevisitedStepan Holub. cwords 2019: 217-225 [doi]

On Substitutions Closed Under Derivation: ExamplesVáclav Kosík, Stepán Starosta. cwords 2019: 226-237 [doi]

Templates for the k-Binomial Complexity of the Tribonacci WordMarie Lejeune, Michel Rigo, Matthieu Rosenfeld. cwords 2019: 238-250 [doi]

Matching Patterns with VariablesFlorin Manea, Markus L. Schmid. cwords 2019: 1-27 [doi]

Derived Sequences of Arnoux-Rauzy SequencesKaterina Medková. cwords 2019: 251-263 [doi]

Combinatorics on Words - 12th International Conference, WORDS 2019, Loughborough, UK, September 9-13, 2019, ProceedingsRobert Mercas, Daniel Reidenbach, editors, Volume 11682 of Lecture Notes in Computer Science, Springer, 2019. [doi]

New Results on Pseudosquare AvoidanceTim Ng, Pascal Ochem, Narad Rampersad, Jeffrey Shallit. cwords 2019: 264-274 [doi]

Every Nonnegative Real Number Is an Abelian Critical ExponentJarkko Peltomäki, Markus A. Whiteland. cwords 2019: 275-285 [doi]

Abelian Properties of WordsSvetlana Puzynina. cwords 2019: 28-45 [doi]

Rich Words Containing Two Given FactorsJosef Rukavicka. cwords 2019: 286-298 [doi]

Mortality and Synchronization of Unambiguous Finite AutomataAndrew Ryzhikov. cwords 2019: 299-311 [doi]

Independent Systems of Word Equations: From Ehrenfeucht to EighteenAleksi Saarela. cwords 2019: 60-67 [doi]

On Discrete Idempotent PathsLuigi Santocanale. cwords 2019: 312-325 [doi]

2017

Variants Around the Bresenham MethodJean-Pierre Borel. cwords 2017: 177-189 [doi]

Combinatorics on Words - 11th International Conference, WORDS 2017, Montréal, QC, Canada, September 11-15, 2017, ProceedingsSrecko Brlek, Francesco Dolce, Christophe Reutenauer, Élise Vandomme, editors, Volume 10432 of Lecture Notes in Computer Science, Springer, 2017. [doi]

Symmetric Dyck Paths and Hooley's Δ-FunctionJosé Manuel Rodríguez Caballero. cwords 2017: 252-261 [doi]

Combinatorics of Cyclic Shifts in Plactic, Hypoplactic, Sylvester, and Related MonoidsAlan J. Cain, António Malheiro. cwords 2017: 190-202 [doi]

A Set of Sequences of Complexity 2n+1 2 n + 1Julien Cassaigne, Sébastien Labbé, Julien Leroy 0002. cwords 2017: 144-156 [doi]

A Permutation on Words in a Two Letter AlphabetNiccolò Castronuovo, Robert Cori, Sébastien Labbé. cwords 2017: 240-251 [doi]

Matching Lexicographic and Conjugation Orders on the Conjugation Class of a Special Sturmian MorphismDavid Clampitt, Thomas Noll. cwords 2017: 85-96 [doi]

Equations Enforcing Repetitions Under PermutationsJoel D. Day, Pamela Fleischmann, Florin Manea, Dirk Nowotka. cwords 2017: 72-84 [doi]

Church-Rosser Systems, Codes with Bounded Synchronization Delay and Local Rees ExtensionsVolker Diekert, Lukas Fleischer. cwords 2017: 6-16 [doi]

First Steps in the Algorithmic Reconstruction of Digital Convex SetsPaolo Dulio, Andrea Frosini, Simone Rinaldi, Lama Tarsissi, Laurent Vuillon. cwords 2017: 164-176 [doi]

The Word Entropy and How to Compute ItSébastien Ferenczi, Christian Mauduit, Carlos Gustavo Moreira. cwords 2017: 157-163 [doi]

Minimal Forbidden Factors of Circular WordsGabriele Fici, Antonio Restivo, Laura Rizzo. cwords 2017: 36-48 [doi]

A de Bruijn Sequence Construction by Concatenating Cycles of the Complemented Cycling RegisterDaniel Gabric, Joe Sawada. cwords 2017: 49-58 [doi]

Commutation and Beyond - Extended AbstractStepan Holub. cwords 2017: 1-5 [doi]

Abelian Complexity of Thue-Morse Word over a Ternary AlphabetIdrissa Kaboré, Boucaré Kientéga. cwords 2017: 132-143 [doi]

Study of Christoffel Classes: Normal Form and PeriodicityMélodie Lapointe. cwords 2017: 109-120 [doi]

Burrows-Wheeler Transform and Run-Length EncondingSabrina Mantaci, Antonio Restivo, Giovanna Rosone, Marinella Sciortino. cwords 2017: 228-239 [doi]

Invariance: A Theoretical Approach for Coding Sets of Words Modulo Literal (Anti)MorphismsJean Néraud, Carla Selmi. cwords 2017: 214-227 [doi]

On Some Interesting Ternary FormulasPascal Ochem, Matthieu Rosenfeld. cwords 2017: 30-35 [doi]

On Arithmetic Index in the Generalized Thue-Morse WordOlga G. Parshina. cwords 2017: 121-131 [doi]

On Words with the Zero Palindromic DefectEdita Pelantová, Stepán Starosta. cwords 2017: 59-71 [doi]

More on the Dynamics of the Symbolic Square Root Map - (Extended Abstract)Jarkko Peltomäki, Markus A. Whiteland. cwords 2017: 97-108 [doi]

Overpals, Underlaps, and UnderpalsAayush Rajasekaran, Narad Rampersad, Jeffrey Shallit. cwords 2017: 17-29 [doi]

Palindromic Length in Free Monoids and Free GroupsAleksi Saarela. cwords 2017: 203-213 [doi]

2015

Canonical Representatives of Morphic PermutationsSergey V. Avgustinovich, Anna E. Frid, Svetlana Puzynina. cwords 2015: 59-72 [doi]

Ambiguity of Morphisms in a Free GroupJoel D. Day, Daniel Reidenbach. cwords 2015: 97-108 [doi]

Degrees of TransducibilityJörg Endrullis, Jan Willem Klop, Aleksi Saarela, Markus Whiteland. cwords 2015: 1-13 [doi]

The Degree of Squares is an AtomJörg Endrullis, Clemens Grabmayer, Dimitri Hendriks, Hans Zantema. cwords 2015: 109-121 [doi]

On the Contribution of WORDS to the Field of Combinatorics on WordsJean Néraud. cwords 2015: 27-34 [doi]

On Arithmetic Progressions in the Generalized Thue-Morse WordOlga G. Parshina. cwords 2015: 191-196 [doi]

A Square Root Map on Sturmian Words - (Extended Abstract)Jarkko Peltomäki, Markus Whiteland. cwords 2015: 197-209 [doi]

Codes and Automata in Minimal SetsDominique Perrin. cwords 2015: 35-46 [doi]

On the Tree of Ternary Square-Free WordsElena A. Petrova, Arseny M. Shur. cwords 2015: 223-236 [doi]

Thue-Morse Along Two Polynomial SubsequencesThomas Stoll. cwords 2015: 47-58 [doi]

Sign in or sign up to see more results.

runs on WebDSL