default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheoretical Computer Science, Volume 32
Volume 32, 1984
- Jean-Claude Raoult:
On Graph Rewritings. 1-24 - Nissim Francez, Daniel Lehmann, Amir Pnueli:
A Linear-History Semantics for Languages for Distributed Programming. 25-46 - Jürgen Duske, Rainer Parchmann:
Linear Indexed Languages. 47-60 - Jürgen Avenhaus, Klaus Madlener:
The Nielsen Reduction and P-Complete Problems in Free Groups. 61-76 - Francis Y. L. Chin, Peter Kossowski, S. C. Loh:
Efficient Inference Control for Range SUM Queries. 77-86 - Etsuji Tomita:
An Extended Direct Branching Algorithm for Checking Equivalence of Deterministic Pushdown Automata. 87-120 - Egidio Astesiano, Gerardo Costa:
Distributive Semantics for Nondeterministic Typed lambda-Calculi. 121-156 - Uzi Vishkin:
A Parallel-Design Distributed-Implementation (PDDI) General-Purpose Computer. 157-172 - Ken McAloon:
Petri Nets and Large Finite Sets. 173-183 - David Maier, Jeffrey D. Ullman:
Connections in Acyclic Hypergraphs. 185-199 - Thomas Eric Hall:
Biprefix Codes, Inverse Semigroups and Syntactic Monoids of Injective Automata. 201-213 - Roy Meshulam:
A Geometric Construction of a Superconcentrator of Depth 2. 215-219 - Jia-Wei Hong:
A Tradeoff Theorem for Space and Reversal. 221-224 - Karel Culík II, Sheng Yu:
Iterative Tree Automata. 227-247 - Friedrich Otto:
Finite Complete Rewriting Systems for the Jantzen Monoid and the Greendlinger Group. 249-260 - Valtteri Niemi:
The Undecidability of Form Equivalence for Context-Free and E0L Forms. 261-277 - Jürgen Avenhaus, Klaus Madlener:
On the Complexity of Intersection and Conjugacy Problems in Free Groups. 279-295 - Jussi Ketonen, Richard W. Weyhrauch:
A Decidable Fragment of Predicate Calculus. 297-307 - N. G. de Bruijn:
Some Machines Defined bu Directed Graphs. 309-319 - Satoru Miyano, Takeshi Hayashi:
Alternating Finite Automata on omega-Words. 321-330 - Ludwig Staiger:
Projection Lemmas for omega-Languages. 331-337 - Gérard Jacob, Christophe Reutenauer:
On Formal Power Series Defined by Infinite Linear Systems. 339-340
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.
last updated on 2025-05-12 21:45 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
