Digitale Bibliotheek
Sluiten Bladeren door artikelen uit een tijdschrift
     Tijdschrift beschrijving
       Alle jaargangen van het bijbehorende tijdschrift
         Alle afleveringen van het bijbehorende jaargang
                                       Alle artikelen van de bijbehorende aflevering
 
                             55 gevonden resultaten
nr titel auteur tijdschrift jaar jaarg. afl. pagina('s) type
1 About randomised distributed graph colouring and graph partition algorithms Métivier, Y.
2010
220-221 11 p. 1296-1304
9 p.
artikel
2 Approximation hardness of dominating set problems in bounded degree graphs Chlebík, M.
2008
220-221 11 p. 1264-1275
12 p.
artikel
3 Asymptotic behavior of the numbers of runs and microruns Giraud, Mathieu
2009
220-221 11 p. 1221-1228
8 p.
artikel
4 Automatic presentations for semigroups Cain, Alan J.
2009
220-221 11 p. 1156-1168
13 p.
artikel
5 Bouziane’s transformation of the Petri net reachability problem and incorrectness of the related algorithm Jančar, Petr
2008
220-221 11 p. 1259-1263
5 p.
artikel
6 Characterizing contextual equivalence in calculi with passivation Lenglet, Sergueï
2011
220-221 11 p. 1390-1433
44 p.
artikel
7 Consistent and coherent learning with δ-delay Akama, Yohji
2008
220-221 11 p. 1362-1374
13 p.
artikel
8 Decision problem for shuffled genes Petre, Ion
2008
220-221 11 p. 1346-1352
7 p.
artikel
9 Detecting palindromes, patterns and borders in regular languages Anderson, Terry
2009
220-221 11 p. 1096-1118
23 p.
artikel
10 Editorial Board 2006
220-221 11 p. CO2-
1 p.
artikel
11 Editorial Board 2006
220-221 11 p. i-
1 p.
artikel
12 Editorial Board 2011
220-221 11 p. i-
1 p.
artikel
13 Editorial Board 2011
220-221 11 p. IFC-
1 p.
artikel
14 Editorial Board (continued) 2010
220-221 11 p. i-
1 p.
artikel
15 Editorial Board (continued) 2008
220-221 11 p. i-
1 p.
artikel
16 Editorial Board (continued) 2007
220-221 11 p. i-
1 p.
artikel
17 Editorial Board (continued) 2009
220-221 11 p. i-
1 p.
artikel
18 Efficient inclusion checking for deterministic tree automata and XML Schemas Champavère, Jérôme
2009
220-221 11 p. 1181-1208
28 p.
artikel
19 Ehrenfeucht–Fraïssé goes automatic for real addition Klaedtke, Felix
2010
220-221 11 p. 1283-1295
13 p.
artikel
20 Finite-state dimension and real arithmetic Doty, David
2007
220-221 11 p. 1640-1651
12 p.
artikel
21 Information theory in property testing and monotonicity testing in higher dimension Ailon, Nir
2006
220-221 11 p. 1704-1717
14 p.
artikel
22 Inside Front Cover: Editorial Board 2010
220-221 11 p. IFC-
1 p.
artikel
23 Inside Front Cover: Editorial Board 2009
220-221 11 p. IFC-
1 p.
artikel
24 Inside Front Cover: Editorial Board 2008
220-221 11 p. IFC-
1 p.
artikel
25 Inside Front Cover: Editorial Board 2007
220-221 11 p. IFC-
1 p.
artikel
26 Logics of communication and change Benthem, Johan van
2006
220-221 11 p. 1620-1662
43 p.
artikel
27 Magic numbers in the state hierarchy of finite automata Geffert, Viliam
2007
220-221 11 p. 1652-1670
19 p.
artikel
28 Match-bounds revisited Korp, Martin
2009
220-221 11 p. 1259-1283
25 p.
artikel
29 Minimality in template-guided recombination Domaratzki, Michael
2009
220-221 11 p. 1209-1220
12 p.
artikel
30 Minimizing deterministic weighted tree automata Maletti, Andreas
2009
220-221 11 p. 1284-1299
16 p.
artikel
31 Modelling concurrency with comtraces and generalized comtraces Janicki, Ryszard
2011
220-221 11 p. 1355-1389
35 p.
artikel
32 Natural halting probabilities, partial randomness, and zeta functions Calude, Cristian S.
2006
220-221 11 p. 1718-1739
22 p.
artikel
33 2nd International Conference on Language and Automata Theory and Applications (LATA 2008) Martín-Vide, Carlos
2009
220-221 11 p. 1095-
1 p.
artikel
34 On input-revolving deterministic and nondeterministic finite automata Bensch, Suna
2009
220-221 11 p. 1140-1155
16 p.
artikel
35 On linear logic planning and concurrency Kahramanoğulları, Ozan
2009
220-221 11 p. 1229-1258
30 p.
artikel
36 On periodicity of generalized two-dimensional infinite words Puzynina, S.A.
2009
220-221 11 p. 1315-1328
14 p.
artikel
37 On the complexity of sequential rectangle placement in IEEE 802.16/WiMAX systems Israeli, Amos
2008
220-221 11 p. 1334-1345
12 p.
artikel
38 On the complexity of the two-variable guarded fragment with transitive guards Kieroński, Emanuel
2006
220-221 11 p. 1663-1703
41 p.
artikel
39 On the induction operation for shift subspaces and cellular automata as presentations of dynamical systems Capobianco, Silvio
2009
220-221 11 p. 1169-1180
12 p.
artikel
40 On the universe, disjointness, and containment problems for simple machines Ibarra, Oscar H.
2010
220-221 11 p. 1273-1282
10 p.
artikel
41 Optimal vertex ranking of block graphs Hung, Ruo-Wei
2008
220-221 11 p. 1288-1302
15 p.
artikel
42 Probabilistic bisimulations for quantum processes Feng, Yuan
2007
220-221 11 p. 1608-1639
32 p.
artikel
43 Pure future local temporal logics are expressively complete for Mazurkiewicz traces Diekert, Volker
2006
220-221 11 p. 1597-1619
23 p.
artikel
44 Rational subsets of polycyclic monoids and valence automata Render, Elaine
2009
220-221 11 p. 1329-1339
11 p.
artikel
45 Reachability problems in quaternion matrix and rotation semigroups Bell, Paul
2008
220-221 11 p. 1353-1361
9 p.
artikel
46 Some (in)sufficient conditions for secure hybrid encryption Herranz, Javier
2010
220-221 11 p. 1243-1257
15 p.
artikel
47 Some natural conditions on incremental learning Jain, Sanjay
2007
220-221 11 p. 1671-1684
14 p.
artikel
48 Taylor approximation for hybrid systems Lanotte, Ruggero
2007
220-221 11 p. 1575-1607
33 p.
artikel
49 The expressive power of the shuffle product Berstel, Jean
2010
220-221 11 p. 1258-1272
15 p.
artikel
50 The Minimum Substring Cover problem Hermelin, Danny
2008
220-221 11 p. 1303-1312
10 p.
artikel
51 The three-color and two-color Tantrix™ rotation puzzle problems are NP-complete via parsimonious reductions Baumeister, Dorothea
2009
220-221 11 p. 1119-1139
21 p.
artikel
52 Tree exploration with advice Fraigniaud, Pierre
2008
220-221 11 p. 1276-1287
12 p.
artikel
53 Two-dimensional hierarchies of proper languages of lexicalized FRR-automata Plátek, Martin
2009
220-221 11 p. 1300-1314
15 p.
artikel
54 3-Valued abstraction: More precision at less cost Shoham, Sharon
2008
220-221 11 p. 1313-1333
21 p.
artikel
55 Variants of codes and indecomposable languages Salomaa, Arto
2009
220-221 11 p. 1340-1349
10 p.
artikel
                             55 gevonden resultaten
 
 Koninklijke Bibliotheek - Nationale Bibliotheek van Nederland