Volume 363; Issue 2

Theoretical Computer Science

Volume 363; Issue 2
4

Restarting automata with restricted utilization of auxiliary symbols

Tomasz Jurdziński, Friedrich Otto
Journal:
Theoretical Computer Science
Year:
2006
Language:
english
File:
PDF, 328 KB
english, 2006
5

The structure of subword graphs and suffix trees of Fibonacci words

Wojciech Rytter
Journal:
Theoretical Computer Science
Year:
2006
Language:
english
File:
PDF, 486 KB
english, 2006
6

Observations on determinization of Büchi automata

Christoph Schulte Althoff, Wolfgang Thomas, Nico Wallmeier
Journal:
Theoretical Computer Science
Year:
2006
Language:
english
File:
PDF, 331 KB
english, 2006
7

On size reduction techniques for multitape automata

Hellis Tamm, Matti Nykänen, Esko Ukkonen
Journal:
Theoretical Computer Science
Year:
2006
Language:
english
File:
PDF, 342 KB
english, 2006
8

Deterministic catalytic systems are not universal

Oscar H. Ibarra, Hsu-Chun Yen
Journal:
Theoretical Computer Science
Year:
2006
Language:
english
File:
PDF, 251 KB
english, 2006
9

Editorial

Jacques Farré, Igor Litovsky
Journal:
Theoretical Computer Science
Year:
2006
Language:
english
File:
PDF, 102 KB
english, 2006
10

Experiments with deterministic -automata for formulas of linear temporal logic

Joachim Klein, Christel Baier
Journal:
Theoretical Computer Science
Year:
2006
Language:
english
File:
PDF, 274 KB
english, 2006
11

The complexity of tree automata and XPath on grammar-compressed trees

Markus Lohrey, Sebastian Maneth
Journal:
Theoretical Computer Science
Year:
2006
Language:
english
File:
PDF, 292 KB
english, 2006