1

Descriptional and computational complexity of finite automata—A survey

Year:
2011
Language:
english
File:
PDF, 377 KB
english, 2011
3

Non-deterministic cellular automata and languages

Year:
2012
Language:
english
File:
PDF, 213 KB
english, 2012
4

THE COMPLEXITY OF REGULAR(-LIKE) EXPRESSIONS

Year:
2011
Language:
english
File:
PDF, 278 KB
english, 2011
5

Set Automata

Year:
2016
Language:
english
File:
PDF, 344 KB
english, 2016
6

Reversible Limited Automata

Year:
2017
Language:
english
File:
PDF, 454 KB
english, 2017
7

Finite turns and the regular closure of linear context-free languages

Year:
2007
Language:
english
File:
PDF, 261 KB
english, 2007
8

On One-way One-bit O (One)-message Cellular Automata

Year:
2009
Language:
english
File:
PDF, 329 KB
english, 2009
9

On the descriptional power of heads, counters, and pebbles

Year:
2005
Language:
english
File:
PDF, 230 KB
english, 2005
10

The size of Higman–Haines sets

Year:
2007
Language:
english
File:
PDF, 342 KB
english, 2007
11

Determination of finite automata accepting subregular languages

Year:
2009
Language:
english
File:
PDF, 1.12 MB
english, 2009
12

Regulated nondeterminism in pushdown automata

Year:
2009
Language:
english
File:
PDF, 821 KB
english, 2009
13

Complexity of multi-head finite automata: Origins and directions

Year:
2011
Language:
english
File:
PDF, 306 KB
english, 2011
14

Cellular automata with limited inter-cell bandwidth

Year:
2011
Language:
english
File:
PDF, 529 KB
english, 2011
15

Massively parallel fault tolerant computations on syntactical patterns

Year:
2002
Language:
english
File:
PDF, 601 KB
english, 2002
16

Some relations between massively parallel arrays

Year:
1997
Language:
english
File:
PDF, 1.27 MB
english, 1997
17

Cellular automata

Year:
1997
Language:
english
File:
PDF, 55 KB
english, 1997
18

Deterministic Turing machines in the range between real-time and linear-time

Year:
2002
Language:
english
File:
PDF, 236 KB
english, 2002
19

Fast one-way cellular automata

Year:
2003
Language:
english
File:
PDF, 333 KB
english, 2003
20

Pushdown cellular automata

Year:
1999
Language:
english
File:
PDF, 1.35 MB
english, 1999
21

The Boolean closure of linear context-free languages

Year:
2008
Language:
english
File:
PDF, 321 KB
english, 2008
22

On stateless deterministic restarting automata

Year:
2010
Language:
english
File:
PDF, 267 KB
english, 2010
23

On time computability of functions in one-way cellular automata

Year:
1998
Language:
english
File:
PDF, 280 KB
english, 1998
25

Context-dependent nondeterminism for pushdown automata

Year:
2007
Language:
english
File:
PDF, 301 KB
english, 2007
26

Real-time reversible iterative arrays

Year:
2010
Language:
english
File:
PDF, 1.96 MB
english, 2010
27

Cellular automata with sparse communication

Year:
2010
Language:
english
File:
PDF, 472 KB
english, 2010
29

Succinct description of regular languages by weak restarting automata

Year:
2008
Language:
english
File:
PDF, 175 KB
english, 2008
30

Fast reversible language recognition using cellular automata

Year:
2008
Language:
english
File:
PDF, 296 KB
english, 2008
32

Decidability of operation problems for T0L languages and subclasses

Year:
2011
Language:
english
File:
PDF, 268 KB
english, 2011
33

Preface

Year:
2012
Language:
english
File:
PDF, 121 KB
english, 2012
34

Nondeterministic state complexity of star-free languages

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

Reversible pushdown automata

Year:
2012
Language:
english
File:
PDF, 262 KB
english, 2012
45

WHEN CHURCH-ROSSER BECOMES CONTEXT FREE

Year:
2007
Language:
english
File:
PDF, 582 KB
english, 2007
47

OPTIMAL SIMULATIONS OF WEAK RESTARTING AUTOMATA

Year:
2008
Language:
english
File:
PDF, 872 KB
english, 2008
49

HYBRID EXTENDED FINITE AUTOMATA

Year:
2007
Language:
english
File:
PDF, 990 KB
english, 2007
50

CONTEXT-FREE GRAMMARS WITH LINKED NONTERMINALS

Year:
2007
Language:
english
File:
PDF, 710 KB
english, 2007