• Nie Znaleziono Wyników

Text Algorithms, EXAM

N/A
N/A
Protected

Academic year: 2021

Share "Text Algorithms, EXAM"

Copied!
1
0
0

Pełen tekst

(1)

Text Algorithms, EXAM, 21/02/2017

We assume that arithmetic operations work in O(1) time. Write the solutions to tasks 1–4 and 5–8 on separate sheets. Justify all your answers, except exercise 1.

1. What is the shift table in the Boyer-Moore algorithm for the pattern a

6

ba

5

ba

5

. 2. What is the number of binary Lyndon words of length 9?

3. Provide a formula for the length of the longest proper border of the Thue-Morse word τ

n

. (τ

0

= 0, τ

1

= 01, τ

2

= 0110...).

4. On which position in the suffix array (counting from 0) of the Fibonacci word F ib

10

is the suffix aba located? (F ib

0

= a, F ib

1

= ab)

5. Is it true that two different words that are each other’s cyclic rotations differ at at least two positions?

6. Design an algorithm that counts in linear time the number of subwords of a binary

word x that are lex. smaller than a given word y.

Cytaty

Powiązane dokumenty

We will get infor- mation from all the ideals, by means of Theorem 1.1 and noting that in fact an ideal is, in some sense, a divisor of its elements.. In this way, we give a new

Two different and easy proofs are presented that a hyperbolic linear homeomorphism of a Banach space admits the shadowing.. In this note we establish two different proofs of

Karol Cwalina and Tomasz Schoen [1] have recently proved the following conjecture of Andrzej Schinzel [4]: the number of solutions of the congruence.. a 1 x

Karol Cwalina and Tomasz Schoen [1] have recently proved the following conjecture of Andrzej Schinzel [4]: the number of solutions of the congruence.. a 1 x

[r]

Suppose that the other two roots are α

[r]

W 2010 roku w strukturach Wojsk Lądowych pozostały następujące związki taktyczne i oddziały: trzy dywizje zmechanizowane, dywizja kawalerii pancernej, dwie brygady