


default search action
Theoretical Computer Science, Volume 61
Volume 61, 1988
- Jeffrey O. Shallit:

A Generalization of Automatic Sequences. 1-16 - Pál Dömösi, Zoltán Ésik:

Critical Classes for the alpha_0-Product. 17-24 - Ivan Mezník:

On a Subclass of Infinite-Regular Languages. 25-32 - Xin He:

A Nearly Optimal Parallel Algorithm for Constructing Maximal Independent Set in Planar Graphs. 33-47 - Carl-Johan H. Seger, Janusz A. Brzozowski:

An Optimistic Ternary Simulation of Gate Races. 49-66 - P. M. van den Broek:

Comparison of Two Graph-Rewrite Systems. 67-81 - Satish R. Thatte:

Implementing First-Order Rewriting with Constructor Systems. 83-92 - Robert Cori, Éric Sopena, Michel Latteux, Yves Roos

:
2-Asynchronous Automata. 93-102 - Ronald V. Book, Ding-Zhu Du:

The Structure of Generalized Complexity Cores. 103-119 - Elias Dahlhaus, Marek Karpinski:

Parallel Construction of Perfect Matchings and Hamiltonian Cycles on Dense Graphs. 121-136 - Tetsuo Moriya, Hideki Yamasaki:

Accepting Conditions for Automata on omega-Languages. 137-147 - K. N. King:

Alternating Multihead Finite Automata. 149-174 - Giuseppe Di Battista

, Roberto Tamassia:
Algorithms for Plane Representations of Acyclic Digraphs. 175-198 - Jay L. Gischer:

The Equational Theory of Pomsets. 199-224 - Werner Alexi:

Extraction and Verification of Programs by Analysis of Formal Proofs. 225-258 - George Gargov, Solomon Passy:

Determinism and Looping in Combinatory PDL. 259-277 - Ludwig Staiger

:
Ein Satz über die Entropie von Untermonoiden (A Theorem on the Entropy of Submonoids). 279-282 - Thomas Kretschmer:

A Closure Property of Regular Languages. 283-287 - André Arnold:

Logical Definability of Fixed Points. 289-297 - Edward G. Belaga:

Bilinear Mincing Rank. 299-306 - Nimrod Megiddo, Uzi Vishkin:

On Finding a Minimum Dominating Set in a Tournament. 307-316 - Richard Kennaway:

On "On Graph Rewritings" (Corrigendum). 317-320

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.


Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID














