Volume 410; Issue 30-32

Theoretical Computer Science

Volume 410; Issue 30-32
1

A new characteristic property of rich words

Michelangelo Bucci, Alessandro De Luca, Amy Glen, Luca Q. Zamboni
Journal:
Theoretical Computer Science
Year:
2009
Language:
english
File:
PDF, 364 KB
english, 2009
2

Nondeterministic state complexity of nested word automata

Yo-Sub Han, Kai Salomaa
Journal:
Theoretical Computer Science
Year:
2009
Language:
english
File:
PDF, 688 KB
english, 2009
3

Some remarks about stabilizers

Volker Diekert, Dalia Krieger
Journal:
Theoretical Computer Science
Year:
2009
Language:
english
File:
PDF, 851 KB
english, 2009
4

Dejean’s conjecture holds for

James Currie, Narad Rampersad
Journal:
Theoretical Computer Science
Year:
2009
Language:
english
File:
PDF, 284 KB
english, 2009
6

Pattern avoidance by palindromes

I.A. Mikhailova, M.V. Volkov
Journal:
Theoretical Computer Science
Year:
2009
Language:
english
File:
PDF, 538 KB
english, 2009
8

On post correspondence problem for letter monotonic languages

Vesa Halava, Jarkko Kari, Yuri Matiyasevich
Journal:
Theoretical Computer Science
Year:
2009
Language:
english
File:
PDF, 300 KB
english, 2009
9

Fine and Wilf words for any periods II

R. Tijdeman, L.Q. Zamboni
Journal:
Theoretical Computer Science
Year:
2009
Language:
english
File:
PDF, 561 KB
english, 2009
12

Simple equations on binary factorial languages

A.E. Frid
Journal:
Theoretical Computer Science
Year:
2009
Language:
english
File:
PDF, 779 KB
english, 2009
13

Sequential SNP systems based on min/max spike number

Oscar H. Ibarra, Andrei Păun, Alfonso Rodríguez-Patón
Journal:
Theoretical Computer Science
Year:
2009
Language:
english
File:
PDF, 1.14 MB
english, 2009
14

Compressed string-matching in standard Sturmian words

Paweł Baturo, Wojciech Rytter
Journal:
Theoretical Computer Science
Year:
2009
Language:
english
File:
PDF, 604 KB
english, 2009
16

Juhani Karhumaki with a capercaillie

Journal:
Theoretical Computer Science
Year:
2009
File:
PDF, 408 KB
2009
17

Editorial Board

Journal:
Theoretical Computer Science
Year:
2009
Language:
english
File:
PDF, 70 KB
english, 2009
18

Characteristic morphisms of generalized episturmian words

Michelangelo Bucci, Aldo de Luca, Alessandro De Luca
Journal:
Theoretical Computer Science
Year:
2009
Language:
english
File:
PDF, 1.27 MB
english, 2009
20

Some operations preserving primitivity of words

Jürgen Dassow, Gema M. Martín, Francisco J. Vico
Journal:
Theoretical Computer Science
Year:
2009
Language:
english
File:
PDF, 654 KB
english, 2009
21

On the number of -power-free binary words for

Vincent D. Blondel, Julien Cassaigne, Raphaël M. Jungers
Journal:
Theoretical Computer Science
Year:
2009
Language:
english
File:
PDF, 809 KB
english, 2009
22

Periodicity, repetitions, and orbits of an automatic sequence

Jean-Paul Allouche, Narad Rampersad, Jeffrey Shallit
Journal:
Theoretical Computer Science
Year:
2009
Language:
english
File:
PDF, 793 KB
english, 2009
23

Burrows–Wheeler transform and palindromic richness

Antonio Restivo, Giovanna Rosone
Journal:
Theoretical Computer Science
Year:
2009
Language:
english
File:
PDF, 558 KB
english, 2009
25

Finding compact structural motifs

Dongbo Bu, Ming Li, Shuai Cheng Li, Jianbo Qian, Jinbo Xu
Journal:
Theoretical Computer Science
Year:
2009
Language:
english
File:
PDF, 447 KB
english, 2009
26

Hierarchy and equivalence of multi-letter quantum finite automata

Daowen Qiu, Sheng Yu
Journal:
Theoretical Computer Science
Year:
2009
Language:
english
File:
PDF, 1.09 MB
english, 2009
27

Preface

Journal:
Theoretical Computer Science
Year:
2009
Language:
english
File:
PDF, 454 KB
english, 2009