Theoretical Computer Science
|
Universiteit Leiden Theoretical Computer Science |
| ||
| Theoretische Informatica Club | ||||
|
|
| 5 July | Hendrik Jan Hoogeboom | Context-Free Valence Grammars -- Revisited |
| 5 July | Sebastian Maneth | Hierarchies of String Languages Generated by Deterministic Tree Transducers |
| 27 September | Roderick Bloem | Efficient Büchi Automata from LTL Formulae |
| 21 December | Nadia Pisanti | On the syntenic distance between genomes |
| 8 March | Nikè van Vugt | Fair sticker languages |
| 22 March | Jetty Kleijn | Local traces and local event structures |
| 5 April | Jurriaan Hage | Characterizing acyclic switching classes using forbidden subgraphs |
| 10 May | Maurice ter Beek Pierluigi Frisco |
Team Automata for Spatial Access Control Diophantine equations and splicing: a new demonstration of the generative capability of H systems |
| 20.10.99 | G. Rozenberg | Formal Calculus for the Process of Gene Assembly in Ciliates |
| 3.11 | P. Frisco | At last the direct universal extended H system |
| 15.11 | G. Rozenberg | Formal Calculus for the Process of Gene Assembly in Ciliates (ctd.) |
Bespreking van hoofdstukken uit het boek Descriptive Complexity van Immerman.
| 22.9 | Sebastian Maneth | Ch. 1 - Background in Logic |
| 13.10 & 27.10 | Joost Engelfriet | Ch. 2 - Background in Complexity |
| 15.11 & 29.11 | Pierluigi Frisco | Ch. 3 - First-Order Reductions |
| 13.12 | Jurriaan Hage | Ch. 4 - Inductive Definitions |
| 10 February 1999 | G. Rozenberg | DNA computing in vivo: the arrangement of DNA in ciliates |
| 22/23 February 1999 | Meeting | European Molecular Computing Consortium |
| 3 March 1999 | Nikè van Vugt | Forbidding - enforcing systems |
| 17 March 1999 | Pierluigi Frisco | Arithmetics with splicing |
| 14 April 1999 | Jetty Kleijn | Processes of inhibitor nets |
| 28 April 1999 | Joost Engelfriet | Tree-walking pebble automata and first-order logic |
| 12 May 1999 | Rudy van Vliet | DNA notation: the case of no nicks |
| 19 May 1999 | Jetty Kleijn | Processes of inhibitor nets, part 2 |
| 26 May 1999 | Sebastian Maneth | MSO definability of macro tree transductions is decidable |
| 30 September 1998 | Maurice ter Beek | Petri net controlled grammar systems |
| 7 October 1998 | Nadia Pisanti | A study of duplication of genes by using graphs |
| 21 October 1998 | Joost Engelfriet | Pebble automata for trips on trees |
| 4 November 1998 | Jurriaan Hage | Complexity issues in switching of graphs |
| Sebastian Maneth | Tree languages generated by context-free graph grammars | |
| 13 November 1998 | Maurice ter Beek | Team automata for groupware systems |
| June 1998 | T. Head | Pascal Lectures: DNA Computing - Design of Experiments |
| 2 June 1998 | L. Ilie | Decision problems on orders of words |
| 10 June 1998 | Natural Computing Day & Blaise Pascal Lecture | |
| July 1998 | Ongoing Workshop on DNA Computing |
| 8.8.97 | Roderick Bloem | Formele Verificatie van Digitale Systemen |
| 24.9.97 | Denis Lapoire | Recognizability equals definability |
| 8.10.97 | Sebastian Maneth | Cooperating Tree and Graph Grammars |
| 15.10.97 | Frits Vaandrager (KUN) | Introduction to the Theory of I/O Automata |
| 22.10.97 | A. Mateescu | Shuffle on Trajectories |
| 12.11.97 | G. Paun | DNA Computing by Splicing; Recent Results |
| 19.11.97 | Hendrik Jan Hoogeboom | Logic and Machines |
| 15.12.97 15-17u. |
Rémi Morin (LRI, Univ. Paris-Sud, Orsay) |
Event Structures & Trace Languages, beyond Projectivity |
| 17.12.97 | G. Rozenberg | Computing by Forbidding and Enforcing |
| 18.12.97 | Laurent Rosaz | The word problem is NP-hard for traces generated by relations of the form cab = cba. |
| 30.1.97 | G. Rozenberg | Forbidding and enforcing |
| 13.2 | J. Engelfriet | Derivation trees of ground term rewriting systems |
| 20.2 | E. Csuhaj-Varjú | Networks of language processors |
| 27.2 | J. Hage | Embedding in 2-classes of group labeled 2-structures |
| 3.4 | H. J. Hoogeboom | Traces, an introduction |
| 17.4 | Tj. Gelsema | An introduction to the pi-calculus |
| 15.5 | M. ter Beek | Logic grammars and natural language |
| 29.5 | S. Maneth | Tree transductions defined by monadic second order logic |
| 5.6 | N. van Vugt | DNA Computing: basic models |
| 19.6 | H.C.M. Kleijn | Petri Nets and generalizations of traces |
