Volume 450; Issue none

Theoretical Computer Science

Volume 450; Issue none
1

Preface

Year:
2012
Language:
english
File:
PDF, 120 KB
english, 2012
2

Complexity of problems concerning reset words for cyclic and Eulerian automata

Year:
2012
Language:
english
File:
PDF, 282 KB
english, 2012
3

Smaller representation of finite state automata

Year:
2012
Language:
english
File:
PDF, 1.11 MB
english, 2012
5

Sampling different kinds of acyclic automata using Markov chains

Year:
2012
Language:
english
File:
PDF, 287 KB
english, 2012
6

Loops and overloops for Tree-Walking Automata

Year:
2012
Language:
english
File:
PDF, 368 KB
english, 2012
7

Analysis of a cellular automaton model for car traffic with a junction

Year:
2012
Language:
english
File:
PDF, 2.94 MB
english, 2012
8

Nondeterministic state complexity of star-free languages

Year:
2012
Language:
english
File:
PDF, 289 KB
english, 2012
10

A finite state intersection approach to propositional satisfiability

Year:
2012
Language:
english
File:
PDF, 354 KB
english, 2012
11

Using minimal absent words to build phylogeny

Year:
2012
Language:
english
File:
PDF, 379 KB
english, 2012
12

Obituary for Sheng Yu

Year:
2012
Language:
english
File:
PDF, 120 KB
english, 2012
13

Editorial Board

Year:
2012
Language:
english
File:
PDF, 58 KB
english, 2012