Growth problems for avoidable words
نویسندگان
چکیده
منابع مشابه
On Avoidable Two Element Sets of Partial Words∗
This paper considers the problem of finding avoiding words given sets of partial words of the form {a 1a m2 . . . ka, b 1b n2 . . . lb} where a and b are letters in the alphabet and is a hole, or showing the set is unavoidable. Such a set is avoidable if and only if there exists a two-sided infinite full word with no factor compatible with a member of the set, and this word is called the avoidi...
متن کاملOpen Problems on Partial Words
The theory of formal languages is widely accepted as the backbone of theoretical computer science. It mainly originated from mathematics (combi-natorics, algebra, mathematical logic) and generative linguistics. Later, new specializations emerged from areas of either computer science (concurrent and distributed systems, computer graphics, artificial life), biology (plant development , molecular ...
متن کاملWord Problems on Compressed Words
Motivation In general, computational problems become harder, when inputs are represented in a compressed form. Motivation In general, computational problems become harder, when inputs are represented in a compressed form. • Develop efficient algorithms on compressed data (strings, trees, pictures) that operate directly on compressed data without decompressing them first. • Prove lower bounds on...
متن کاملCovering Problems for Partial Words and for Indeterminate Strings
We consider the problem of computing a shortest solid cover of an indeterminate string. An indeterminate string may contain non-solid symbols, each of which specifies a subset of the alphabet that could be present at the corresponding position. We also consider covering partial words, which are a special case of indeterminate strings where each non-solid symbol is a don’t care symbol. We prove ...
متن کاملCrucial words and the complexity of some extremal problems for sets of prohibited words
We introduced the notation of a set of prohibitions and give definitions of a complete set and a crucial word with respect to a given set of prohibitions. We consider 3 particular sets which appear in different areas of mathematics and for each of them examine the length of a crucial word. One of these sets is proved to be incomplete. The problem of determining lengths of words that are free fr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1989
ISSN: 0304-3975
DOI: 10.1016/0304-3975(89)90071-6