Conferences in DBLP

Birthday ... (birthday)
2002 (conf/birthday/2002rozenberg)

1. Jean Berstel, Luc Boasson
   Balanced Grammars and Their Languages. [Citation Graph (0, 0)][DBLP]
   Formal and Natural Computing, 2002, pp:3-25 [Conf]
   
2. Volker Diekert, Paul Gastin
   Safety and Liveness Properties for Real Traces and a Direct Translation from LTL to Monoids. [Citation Graph (0, 0)][DBLP]
   Formal and Natural Computing, 2002, pp:26-38 [Conf]
   
3. Joost Engelfriet
   The Delta Operation: From Strings to Trees to Strings. [Citation Graph (0, 0)][DBLP]
   Formal and Natural Computing, 2002, pp:39-56 [Conf]
   
4. Vesa Halava, Tero Harju
   Infinite Solutions of Marked Post Correspondence Problem. [Citation Graph (0, 0)][DBLP]
   Formal and Natural Computing, 2002, pp:57-68 [Conf]
   
5. Juhani Karhumäki, Ion Petre
   The Branching Point Approach to Conway's Problem. [Citation Graph (0, 0)][DBLP]
   Formal and Natural Computing, 2002, pp:69-76 [Conf]
   
6. Aldo de Luca
   A Survey of Some Quantitative Approaches to the Notion of Information. [Citation Graph (0, 0)][DBLP]
   Formal and Natural Computing, 2002, pp:77-95 [Conf]
   
7. Alexandru Mateescu, Arto Salomaa
   Nondeterministic Trajectories. [Citation Graph (0, 0)][DBLP]
   Formal and Natural Computing, 2002, pp:96-106 [Conf]
   
8. Antonio Restivo, Sergio Salemi
   Binary Patterns in Infinite Binary Words. [Citation Graph (0, 0)][DBLP]
   Formal and Natural Computing, 2002, pp:107-118 [Conf]
   
9. Hans-Jörg Kreowski
   A Sight-seeing Tour of the Computational Landscape of Graph Transformation. [Citation Graph (0, 0)][DBLP]
   Formal and Natural Computing, 2002, pp:119-137 [Conf]
   
10. Dirk Janssens
    Local Action Systems and DPO Graph Transformation. [Citation Graph (0, 0)][DBLP]
    Formal and Natural Computing, 2002, pp:138-157 [Conf]
    
11. Paolo Baldan, Andrea Corradini, Ugo Montanari
    Bisimulation Equivalences for Graph Grammars. [Citation Graph (0, 0)][DBLP]
    Formal and Natural Computing, 2002, pp:158-190 [Conf]
    
12. Hartmut Ehrig, Kathrin Hoffmann, Julia Padberg, Paolo Baldan, Reiko Heckel
    High-Level Net Processes. [Citation Graph (0, 0)][DBLP]
    Formal and Natural Computing, 2002, pp:191-219 [Conf]
    
13. Maurice H. ter Beek, H. C. M. Kleijn
    Petri Net Control for Grammar Systems. [Citation Graph (0, 0)][DBLP]
    Formal and Natural Computing, 2002, pp:220-243 [Conf]
    
14. P. S. Thiagarajan
    Regular Event Structures and Finite Petri Nets: A Conjecture. [Citation Graph (0, 0)][DBLP]
    Formal and Natural Computing, 2002, pp:244-256 [Conf]
    
15. Gregor Engels, Luuk Groenewegen
    Towards Team-Automata-Driven Object-Oriented Collaborative Work. [Citation Graph (0, 0)][DBLP]
    Formal and Natural Computing, 2002, pp:257-276 [Conf]
    
16. Javier Esparza
    Grammars as Processes. [Citation Graph (0, 0)][DBLP]
    Formal and Natural Computing, 2002, pp:277-297 [Conf]
    
17. Mogens Nielsen, Frank D. Valencia
    Temporal Concurrent Constraint Programming: Applications and Behavior. [Citation Graph (0, 0)][DBLP]
    Formal and Natural Computing, 2002, pp:298-324 [Conf]
    
18. Paolo Bottoni, Anna Labella, Carlos Martín-Vide, Gheorghe Paun
    Rewriting P Systems with Conditional Communication. [Citation Graph (0, 0)][DBLP]
    Formal and Natural Computing, 2002, pp:325-353 [Conf]
    
19. Tom Head
    An Aqueous Algorithm for Finding the Bijections Contained in a Binary Relation. [Citation Graph (0, 0)][DBLP]
    Formal and Natural Computing, 2002, pp:354-360 [Conf]
    
20. Hendrik Jan Hoogeboom, Nike van Vugt
    Upper Bounds for Restricted Splicing. [Citation Graph (0, 0)][DBLP]
    Formal and Natural Computing, 2002, pp:361-375 [Conf]
    
21. Lila Kari, Rob Kitto, Gabriel Thierrin
    Codes, Involutions, and DNA Encodings. [Citation Graph (0, 0)][DBLP]
    Formal and Natural Computing, 2002, pp:376-393 [Conf]
    
22. David M. Prescott
    DNA Manipulations in Ciliates. [Citation Graph (0, 0)][DBLP]
    Formal and Natural Computing, 2002, pp:394-417 [Conf]
    
23. Takashi Yokomori, Yasubumi Sakakibara, Satoshi Kobayashi
    A Magic Pot : Self-assembly Computation Revisited. [Citation Graph (0, 0)][DBLP]
    Formal and Natural Computing, 2002, pp:418-430 [Conf]