Theoretical Computer Science, Volume 205

Volume 205, Numbers 1-2, 28 September 1998

• Magnus Steinby:
  General Varieties of Tree Languages. 1-43
  Electronic Edition (link) BibTeX
• Beate Bollig, Martin Sauerhoff, Detlef Sieling, Ingo Wegener:
  Hierarchy Theorems for kOBDDs and kIBDDs. 45-60
  Electronic Edition (link) BibTeX
• Andrzej Ehrenfeucht, Gheorghe Paun, Grzegorz Rozenberg:
  On Representing Recursively Enumerable Languages by Internal Contextual Languages. 61-83
  Electronic Edition (link) BibTeX
• Chang-Wu Yu, Gen-Huey Chen, Tze-Heng Ma:
  On the Complexity of the k-Chain Subgraph Cover Problem. 85-98
  Electronic Edition (link) BibTeX
• Mordecai J. Golin, Shmuel Zaks:
  Labelled Trees and Pairs of Input-Output Permutations in Priority Queues. 99-114
  Electronic Edition (link) BibTeX
• Michele Flammini, Giorgio Gambosi, Umberto Nanni, Richard B. Tan:
  Multidimensional Interval Routing Schemes. 115-133
  Electronic Edition (link) BibTeX
• Tadakazu Sato:
  Ergodic Characterization of Linear Cellular Automata over Z_m. 135-144
  Electronic Edition (link) BibTeX
• Dora Giammarresi, Sabrina Mantaci, Filippo Mignosi, Antonio Restivo:
  Periodicities on Trees. 145-181
  Electronic Edition (link) BibTeX
• Jérôme Olivier Durand-Lose:
  Parallel Transient Time of One-Dimensional Sand Pile. 183-193
  Electronic Edition (link) BibTeX
• Carlos Martín-Vide, Gheorghe Paun, Arto Salomaa:
  Characterizations of Recursively Enumerable Languages by Means of Insertion Grammars. 195-205
  Electronic Edition (link) BibTeX
• Yves Andre, Francis Bossut:
  On the Equivalence Problem for Letter-to-Letter Top-Down Tree Transducers. 207-229
  Electronic Edition (link) BibTeX
• Biing-Feng Wang:
  Simulating the CRCW PRAM on Reconfigurable Networks. 231-242
  Electronic Edition (link) BibTeX
• Marek Karpinski, Wojciech Rytter:
  Alphabet-Independent Optimal Parallel Search for Three-Dimensional Patterns. 243-260
  Electronic Edition (link) BibTeX
• Alexander E. Andreev, Andrea E. F. Clementi, Pierluigi Crescenzi, Elias Dahlhaus, Sergio De Agostino, José D. P. Rolim:
  The Parallel Complexity of Approximating the High Degree Subgraph Problem. 261-282
  Electronic Edition (link) BibTeX
• Aviezri S. Fraenkel, Michal Ozery:
  Adjoining to Wythoff's Game its P-Positions as Moves. 283-296
  Electronic Edition (link) BibTeX
• Marie-Pierre Béal, Jean Senellart:
  On the Bound of the Synchronization Delay of a Local Automaton. 297-306
  Electronic Edition (link) BibTeX
• Peter A. Beling, Nimrod Megiddo:
  Using Fast Matrix Multiplication to Find Basic Solutions. 307-316
  Electronic Edition (link) BibTeX
• Lane A. Hemaspaandra, Zhigen Jiang, Jörg Rothe, Osamu Watanabe:
  Boolean Operations, Joins, and the Extended Low Hierarchy. 317-327
  Electronic Edition (link) BibTeX
• Huaxiong Wang:
  On Rational Series and Rational Languages. 329-336
  Electronic Edition (link) BibTeX
• Wai-fong Chuan:
  Unbordered Factors of Characteristic Sequences of Irrational Numbers. 337-344
  Electronic Edition (link) BibTeX