Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheoretical Computer Science, Volume 48
Volume 48, 1986
- Zoltán Ésik, Ferenc Gécseg:
On alpha-0-Products and alpha-2-Products. 1-8 - Ker-I Ko:
On the Notion of Infinite Pseudorandom Sequences. 9-33 - Jean-Claude Spehner:
La Reconnaissance des Facteurs d'un Mot dans un Texte. 35-52 - Siegfried Bublitz, Ute Schürfeld, Ingo Wegener:
Properties of Complexity Measures for Prams and Wrams. 53-73 - Clyde P. Kruskal, Marc Snir:
A Unified Theory of Interconnection Network Structure. 75-94 - Richard Statman:
Every Countable Poset is Embeddable in the Poset of Unsolvable Terms. 95-100 - Tom Head, Barbara Lando:
Regularity of Sets of Initial Strings of Periodic D0L-Systems. 101-108 - Juraj Hromkovic:
Communication Complexity Hierarchy. 109-115 - Gérard Berry, Ravi Sethi:
From Regular Expressions to Deterministic Automata. 117-126 - Volker Weispfenning:
The Complexity of the Word Problem for Abelian l-Groups. 127-132 - Maurice Tchuenté:
Sequential Simulation of Parallel Iterations and Applications. 135-144 - V. Wiktor Marek, Helena Rasiowa:
Approximating Sets with Equivalence Relations. 145-152 - Marek Chrobak:
Hierarchies of One-Way Multihead Automata Languages. 153-181 - Christine Duboc:
Mixed Product and Asynchronous Automata. 183-199 - Andrzej Ehrenfeucht, Hendrik Jan Hoogeboom, Grzegorz Rozenberg:
On the Active and Full Use of Memory in Right-Boundary Grammars and Push-Down Automata. 201-228 - Melvin Fitting:
Partial Models and Logic Programming. 229-255 - Wiktor Danko:
First-Order Approximation of Algorithmic Theories. 257-272 - Giuseppe F. Italiano
:
Amortized Efficiency of a Path Retrieval Data Structure. 273-281 - Arto Salomaa:
On a Public-Key Cryptosystem Based on Iterated Morphisms and Substitutions. 283-296 - Seymour Ginsburg, Chang-jie Tang:
Projection of Object Histories. 297-328 - Alan Gibbons, Wojciech Rytter:
On the Decidability of Some Problems about Rational Subsets of Free Partially Commutative Monoids. 329-337 - Joost Engelfriet, Heiko Vogler:
Corrigenda: Pushdown Machines for the Macro Tree Tranducer. 339
a service of 
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 2024-05-06 21:15 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:
