Filters








2 Hits in 3.6 sec

Conferences WORDS, years 1997-2017: Open Problems and Conjectures

Jean Néraud
2018 Bulletin of the European Association for Theoretical Computer Science  
Words is a well-established international conference devoted to all aspects of Combinatorics on Words.  ...  • Question 1.5.15.3: Starting with a single word, does the language of finite words constructed by iterating prefix-suffix square completion remains semi-linear?  ...  reached. 1.5 The prefix-suffix square completion -WORDS 2015: Authors: Marius Dumitran and Florin Manea [52, [147] [148] [149] [150] [151] [152] [153] [154] [155] [156] [157] [158] [159] .  ... 
dblp:journals/eatcs/Neraud18 fatcat:mnojery2ifgj7odnkzakfwrr2m

Ten Conferences WORDS: Open Problems and Conjectures [article]

Jean Néraud
2017 pre-print
In connection to the development of the field of Combinatorics on Words, we present a list of open problems and conjectures that were stated during the ten last meetings WORDS.  ...  • Question 1.5.15.3: Does the language of finite words constructed, starting with a single word, by iterating prefix-suffix square completion remains semi-linear?  ...  • Question 1.5.15.4: Draw studies of languages constructed by iterating prefix-suffix square completion, starting with special sets of initial words such as singleton sets, finite sets, regular sets, etc  ... 
doi:10.13140/rg.2.1.4425.1768/1 arXiv:1705.04055v1 fatcat:koffsi36wzgplnhnq3qxubv2kq