default search action
Bulletin of the EATCS, Volume 83
Volume 83, June 2004
- Peter Sanders:
Algorithms for Memory Hierarchies (Column: Algorithmics). Bull. EATCS 83: 67-85 (2004) - Jacobo Torán:
Space and Width in Propositional Resolution (Column: Computational Complexity). Bull. EATCS 83: 86-104 (2004) - Eugene Asarin:
Challenges in Timed Languages: from applied theory to basic theory (Column: Concurrency). 106-120 - Dahlia Malkhi:
Locality-Aware Network Solutions - A survey (Column: Distributed Computing). Bull. EATCS 83: 121-138 (2004) - Markus Holzer, Barbara König:
Regular Languages, Sizes of Syntactic Monoids, Graph Colouring, State Complexity Results, and How These Topics are Related to Each Other (Column: Formal Language Theory). Bull. EATCS 83: 139-155 (2004) - Hartmut Ehrig:
Integration of Specification Techniques for Applications in Engineering 1998-2004 (Column: Formal Specification). Bull. EATCS 83: 156-158 (2004) - Gheorghe Paun:
Membrane Computing after the Second Brainstorming Week Sevilla, February 2004 (Column: Natural Computing). Bull. EATCS 83: 159-170 (2004)
- Lila Kari, Petr Sosík:
On Language Equations with Deletion. Bull. EATCS 83: 173-180 (2004) - István Katsányi:
A Note on Restricted Insertion-Deletion Systems. Bull. EATCS 83: 181-185 (2004) - José M. Sempere:
A Representation Theorem for Languages Accepted by Watson-Crick Finite Automata. Bull. EATCS 83: 187-191 (2004) - Pedro García, José Ruiz:
A Note on Minimal Cover-Automata for Finite Languages. Bull. EATCS 83: 193-199 (2004)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.