Volume 321; Issue 2-3

Theoretical Computer Science

Volume 321; Issue 2-3
1

On dart-free perfectly contractile graphs

Year:
2004
Language:
english
File:
PDF, 328 KB
english, 2004
2

Analysis of randomized load distribution for reproduction trees in linear arrays and rings

Year:
2004
Language:
english
File:
PDF, 273 KB
english, 2004
3

Graph traversal and graph transformation

Year:
2004
Language:
english
File:
PDF, 262 KB
english, 2004
4

Sturmian words, β-shifts, and transcendence

Year:
2004
Language:
english
File:
PDF, 228 KB
english, 2004
5

Evolution and observation—a non-standard way to generate formal languages

Year:
2004
Language:
english
File:
PDF, 252 KB
english, 2004
6

On Kurtz randomness

Year:
2004
Language:
english
File:
PDF, 309 KB
english, 2004
7

On the least exponential growth admitting uncountably many closed permutation classes

Year:
2004
Language:
english
File:
PDF, 240 KB
english, 2004
9

Average complexity of exact and approximate multiple string matching

Year:
2004
Language:
english
File:
PDF, 194 KB
english, 2004
10

Updatable timed automata

Year:
2004
Language:
english
File:
PDF, 710 KB
english, 2004
11

On the complexity of resolution with bounded conjunctions

Year:
2004
Language:
english
File:
PDF, 339 KB
english, 2004
12

Seventeen lines and one-hundred-and-one points

Year:
2004
Language:
english
File:
PDF, 194 KB
english, 2004
14

Peg-solitaire, string rewriting systems and finite automata

Year:
2004
Language:
english
File:
PDF, 225 KB
english, 2004
15

Author index

Year:
2004
Language:
english
File:
PDF, 193 KB
english, 2004