nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
Asymptotic behavior of the numbers of runs and microruns
|
Giraud, Mathieu |
|
2009 |
207 |
11 |
p. 1221-1228 8 p. |
artikel |
2 |
Automatic presentations for semigroups
|
Cain, Alan J. |
|
2009 |
207 |
11 |
p. 1156-1168 13 p. |
artikel |
3 |
Detecting palindromes, patterns and borders in regular languages
|
Anderson, Terry |
|
2009 |
207 |
11 |
p. 1096-1118 23 p. |
artikel |
4 |
Editorial Board (continued)
|
|
|
2009 |
207 |
11 |
p. i- 1 p. |
artikel |
5 |
Efficient inclusion checking for deterministic tree automata and XML Schemas
|
Champavère, Jérôme |
|
2009 |
207 |
11 |
p. 1181-1208 28 p. |
artikel |
6 |
Inside Front Cover: Editorial Board
|
|
|
2009 |
207 |
11 |
p. IFC- 1 p. |
artikel |
7 |
Match-bounds revisited
|
Korp, Martin |
|
2009 |
207 |
11 |
p. 1259-1283 25 p. |
artikel |
8 |
Minimality in template-guided recombination
|
Domaratzki, Michael |
|
2009 |
207 |
11 |
p. 1209-1220 12 p. |
artikel |
9 |
Minimizing deterministic weighted tree automata
|
Maletti, Andreas |
|
2009 |
207 |
11 |
p. 1284-1299 16 p. |
artikel |
10 |
2nd International Conference on Language and Automata Theory and Applications (LATA 2008)
|
Martín-Vide, Carlos |
|
2009 |
207 |
11 |
p. 1095- 1 p. |
artikel |
11 |
On input-revolving deterministic and nondeterministic finite automata
|
Bensch, Suna |
|
2009 |
207 |
11 |
p. 1140-1155 16 p. |
artikel |
12 |
On linear logic planning and concurrency
|
Kahramanoğulları, Ozan |
|
2009 |
207 |
11 |
p. 1229-1258 30 p. |
artikel |
13 |
On periodicity of generalized two-dimensional infinite words
|
Puzynina, S.A. |
|
2009 |
207 |
11 |
p. 1315-1328 14 p. |
artikel |
14 |
On the induction operation for shift subspaces and cellular automata as presentations of dynamical systems
|
Capobianco, Silvio |
|
2009 |
207 |
11 |
p. 1169-1180 12 p. |
artikel |
15 |
Rational subsets of polycyclic monoids and valence automata
|
Render, Elaine |
|
2009 |
207 |
11 |
p. 1329-1339 11 p. |
artikel |
16 |
The three-color and two-color Tantrix™ rotation puzzle problems are NP-complete via parsimonious reductions
|
Baumeister, Dorothea |
|
2009 |
207 |
11 |
p. 1119-1139 21 p. |
artikel |
17 |
Two-dimensional hierarchies of proper languages of lexicalized FRR-automata
|
Plátek, Martin |
|
2009 |
207 |
11 |
p. 1300-1314 15 p. |
artikel |
18 |
Variants of codes and indecomposable languages
|
Salomaa, Arto |
|
2009 |
207 |
11 |
p. 1340-1349 10 p. |
artikel |