Volume 391; Issue 1-2

Theoretical Computer Science

Volume 391; Issue 1-2
2

Multiple constraints on three and four words

Year:
2008
Language:
english
File:
PDF, 192 KB
english, 2008
3

Cobham–Semenov theorem and -subshifts

Year:
2008
Language:
english
File:
PDF, 469 KB
english, 2008
4

Self-dual tilings with respect to star-duality

Year:
2008
Language:
english
File:
PDF, 696 KB
english, 2008
5

Cancellation and periodicity properties of iterated morphisms

Year:
2008
Language:
english
File:
PDF, 145 KB
english, 2008
6

Regular languages and their generating functions: The inverse problem

Year:
2008
Language:
english
File:
PDF, 271 KB
english, 2008
7

Shuffle operations on discrete paths

Year:
2008
Language:
english
File:
PDF, 653 KB
english, 2008
8

Completing circular codes in regular submonoids

Year:
2008
Language:
english
File:
PDF, 396 KB
english, 2008
9

An algorithm for recognition of n-collapsing words

Year:
2008
Language:
english
File:
PDF, 430 KB
english, 2008
10

A conversion algorithm based on the technique of singularization

Year:
2008
Language:
english
File:
PDF, 590 KB
english, 2008
11

Simple permutations: Decidability and unavoidable substructures

Year:
2008
Language:
english
File:
PDF, 505 KB
english, 2008
12

On periodicity of two-dimensional words

Year:
2008
Language:
english
File:
PDF, 247 KB
english, 2008
13

Symmetrized β -integers

Year:
2008
Language:
english
File:
PDF, 486 KB
english, 2008
14

Editorial Board

Year:
2008
Language:
english
File:
PDF, 71 KB
english, 2008
15

On undecidability bounds for matrix decision problems

Year:
2008
Language:
english
File:
PDF, 313 KB
english, 2008
16

A characterization of fine words over a finite alphabet

Year:
2008
Language:
english
File:
PDF, 258 KB
english, 2008
17

Generalized approximate counting revisited

Year:
2008
Language:
english
File:
PDF, 309 KB
english, 2008
18

Words avoiding repetitions in arithmetic progressions

Year:
2008
Language:
english
File:
PDF, 1.76 MB
english, 2008