P=NP for some structures over the binary words
نویسندگان
چکیده
منابع مشابه
On Generalized Pseudostandard Words Over Binary Alphabets
In this paper, we study generalized pseudostandard words over a two-letter alphabet, which extend the classes of standard Sturmian, standard episturmian and pseudostandard words, allowing different involutory antimorphisms instead of the usual
متن کاملOracles for Binary Words
The paper proposes a solution to the problem of finding an unspecified binary sequence of known length, using an oracle. Three oracles are defined and used in construction of linear algorithms, with the aim of finding an unknown word α. These algoritms build α by by generating all its prefixes, knowing a specified subword, or using a distance defined on sequences of the same length.
متن کاملinvestigating the feasibility of a proposed model for geometric design of deployable arch structures
deployable scissor type structures are composed of the so-called scissor-like elements (sles), which are connected to each other at an intermediate point through a pivotal connection and allow them to be folded into a compact bundle for storage or transport. several sles are connected to each other in order to form units with regular polygonal plan views. the sides and radii of the polygons are...
Characterization of some binary words with few squares
Thue proved that the factors occurring infinitely many times in square-free words over {0,1,2} avoiding the factors in {010,212} are the factors of the fixed point of the morphism 0 7→ 012, 1 7→ 02, 2 7→ 1. He similarly characterized square-free words avoiding {010,020} and {121,212} as the factors of two morphic words. In this paper, we exhibit smaller morphisms to define these two square-free...
متن کاملPeriods and Binary Words
We give an elementary short proof for a well-known theorem of Guibas and Odlyzko stating that the sets of periods of words are independent of the alphabet size. As a consequence of our constructing proof, we give a linear time algorithm which, given a word, computes a binary one with the same periods. We give also a very short proof for the famous Fine and Wilf's periodicity lemma.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Complexity
سال: 2005
ISSN: 0885-064X
DOI: 10.1016/j.jco.2005.02.001