nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
A family of NFAs which need 2 n −α deterministic states
|
Iwama, Kazuo |
|
2003 |
301 |
1-3 |
p. 451-462 12 p. |
artikel |
2 |
A fast algorithm to generate necklaces with fixed content
|
Sawada, Joe |
|
2003 |
301 |
1-3 |
p. 477-489 13 p. |
artikel |
3 |
Ambiguity in omega context free languages
|
Finkel, Olivier |
|
2003 |
301 |
1-3 |
p. 217-270 54 p. |
artikel |
4 |
Approximation of boolean functions by combinatorial rectangles
|
Sauerhoff, Martin |
|
2003 |
301 |
1-3 |
p. 45-78 34 p. |
artikel |
5 |
A property of random context picture grammars
|
van der Walt, Andries |
|
2003 |
301 |
1-3 |
p. 313-320 8 p. |
artikel |
6 |
Arborescence optimization problems solvable by Edmonds’ algorithm
|
Georgiadis, Leonidas |
|
2003 |
301 |
1-3 |
p. 427-437 11 p. |
artikel |
7 |
Architecture independent parallel selection with applications to parallel priority queues
|
Gerbessiotis, Alexandros V. |
|
2003 |
301 |
1-3 |
p. 119-142 24 p. |
artikel |
8 |
Asymptotic orbits of primitive substitutions
|
Barge, Marcy |
|
2003 |
301 |
1-3 |
p. 439-450 12 p. |
artikel |
9 |
Author index
|
|
|
2003 |
301 |
1-3 |
p. 499-500 2 p. |
artikel |
10 |
Completing comma-free codes
|
Lam, Nguyen Huong |
|
2003 |
301 |
1-3 |
p. 399-415 17 p. |
artikel |
11 |
Complexity in the case against accuracy estimation
|
Nock, Richard |
|
2003 |
301 |
1-3 |
p. 143-165 23 p. |
artikel |
12 |
Computing on anonymous networks with sense of direction
|
Flocchini, Paola |
|
2003 |
301 |
1-3 |
p. 355-379 25 p. |
artikel |
13 |
Editorial board v-ix
|
|
|
2003 |
301 |
1-3 |
p. v-ix nvt p. |
artikel |
14 |
Efficient minus and signed domination in graphs
|
Lu, Chin Lung |
|
2003 |
301 |
1-3 |
p. 381-397 17 p. |
artikel |
15 |
Euclidean strings
|
Ellis, John |
|
2003 |
301 |
1-3 |
p. 321-340 20 p. |
artikel |
16 |
Independent domination in finitely defined classes of graphs
|
Boliac, R. |
|
2003 |
301 |
1-3 |
p. 271-284 14 p. |
artikel |
17 |
On congruences of automata defined by directed graphs
|
Kelarev, A.V. |
|
2003 |
301 |
1-3 |
p. 31-43 13 p. |
artikel |
18 |
On primitive recursive algorithms and the greatest common divisor function
|
Moschovakis, Yiannis N. |
|
2003 |
301 |
1-3 |
p. 1-30 30 p. |
artikel |
19 |
On stable cutsets in line graphs
|
Le, Van Bang |
|
2003 |
301 |
1-3 |
p. 463-475 13 p. |
artikel |
20 |
On the bandwidth of a Hamming graph
|
Harper, L.H. |
|
2003 |
301 |
1-3 |
p. 491-498 8 p. |
artikel |
21 |
On the sensitivity of additive cellular automata in Besicovitch topologies
|
Formenti, Enrico |
|
2003 |
301 |
1-3 |
p. 341-354 14 p. |
artikel |
22 |
On three variants of rewriting P systems
|
Ferretti, Claudio |
|
2003 |
301 |
1-3 |
p. 201-215 15 p. |
artikel |
23 |
Optimal insertion in deterministic DAWGs
|
Sgarbas, Kyriakos N. |
|
2003 |
301 |
1-3 |
p. 103-117 15 p. |
artikel |
24 |
The asymptotic distribution of elements in automatic sequences
|
Peter, Manfred |
|
2003 |
301 |
1-3 |
p. 285-312 28 p. |
artikel |
25 |
The multiplicative fragment of the Yanov equational theory
|
Dolinka, Igor |
|
2003 |
301 |
1-3 |
p. 417-425 9 p. |
artikel |
26 |
Two-dimensional cellular automata and deterministic on-line tessalation automata
|
Terrier, Véronique |
|
2003 |
301 |
1-3 |
p. 167-186 20 p. |
artikel |
27 |
Undecidable properties of monoids with word problem solvable in linear time. Part II— cross sections and homological and homotopical finiteness conditions
|
Katsura, Masashi |
|
2003 |
301 |
1-3 |
p. 79-101 23 p. |
artikel |
28 |
Watson–Crick D0L systems: the power of one transition
|
Salomaa, Arto |
|
2003 |
301 |
1-3 |
p. 187-200 14 p. |
artikel |