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