Theoretical Computer Science, Volume 61

Volume 61, 1988

• Jeffrey Shallit: A Generalization of Automatic Sequences. 1-16 BibTeX
• Pál Dömösi, Zoltán Ésik: Critical Classes for the alpha_0-Product. 17-24 BibTeX
• Ivan Mezník: On a Subclass of Infinite-Regular Languages. 25-32 BibTeX
• Xin He: A Nearly Optimal Parallel Algorithm for Constructing Maximal Independent Set in Planar Graphs. 33-47 BibTeX
• Carl-Johan H. Seger, Janusz A. Brzozowski: An Optimistic Ternary Simulation of Gate Races. 49-66 BibTeX
• P. M. van den Broek: Comparison of Two Graph-Rewrite Systems. 67-81 BibTeX
• Satish R. Thatte: Implementing First-Order Rewriting with Constructor Systems. 83-92 BibTeX
• Robert Cori, Eric Sopena, Michel Latteux, Yves Roos: 2-Asynchronous Automata. 93-102 BibTeX
• Ronald V. Book, Ding-Zhu Du: The Structure of Generalized Complexity Cores. 103-119 BibTeX
• Elias Dahlhaus, Marek Karpinski: Parallel Construction of Perfect Matchings and Hamiltonian Cycles on Dense Graphs. 121-136 BibTeX
• Tetsuo Moriya, Hideki Yamasaki: Accepting Conditions for Automata on omega-Languages. 137-147 BibTeX
• K. N. King: Alternating Multihead Finite Automata. 149-174 BibTeX
• Giuseppe Di Battista, Roberto Tamassia: Algorithms for Plane Representations of Acyclic Digraphs. 175-198 BibTeX
• Jay L. Gischer: The Equational Theory of Pomsets. 199-224 BibTeX
• Werner Alexi: Extraction and Verification of Programs by Analysis of Formal Proofs. 225-258 BibTeX
• George Gargov, Solomon Passy: Determinism and Looping in Combinatory PDL. 259-277 BibTeX
• Ludwig Staiger: Ein Satz über die Entropie von Untermonoiden (A Theorem on the Entropy of Submonoids). 279-282 BibTeX
• Thomas Kretschmer: A Closure Property of Regular Languages. 283-287 BibTeX
• André Arnold: Logical Definability of Fixed Points. 289-297 BibTeX
• Edward G. Belaga: Bilinear Mincing Rank. 299-306 BibTeX
• Nimrod Megiddo, Uzi Vishkin: On Finding a Minimum Dominating Set in a Tournament. 307-316 BibTeX
• Richard Kennaway: On ``On Graph Rewritings'' (Corrigendum). 317-320 BibTeX