default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheoretical Computer Science, Volume 41
Volume 41, 1985
- Gheorghe Paun:
A Variant of Random Context Grammars: Semi-Conditional Grammars. 1-17 - Eric Goles Ch.:
Dynamics of Positive Automata Networks. 19-32 - Virgil Emil Cazanescu:
On Context-Free Trees. 33-50 - Philippe Gohon:
An Algorithm to Decide Whether a Rational Subset of N^k is Recognizable. 51-59 - Evelyne Barbin-Le Rest, Michel Le Rest:
Sur la Combinatoire des Codes à Deux Mots. 61-80 - Costas S. Iliopoulos:
Computing in General Abelian Groups is Hard. 81-93 - Susumu Hayashi:
Adjunction of Semifunctors: Categorical Structures in Nonextensional Lambda Calculus. 95-104 - Yael Maon:
On the Equivalence Problem of Compositions of Morphisms and Inverse Morphisms on Context-Free Languages. 105-107 - Jean-Yves Thibon:
Integrité des Algèbres de Séries Formelles sur un Alphabet Partiellement Commutatif. 109-112 - Martin W. Bunder:
Possible Forms of Evaluation or Reduction in Martin-Löf Type Theory. 113-120 - Michael H. Albert, John Lawrence:
A Proof of Ehrenfeucht's Conjecture. 121-123 - Bettina Helfrich:
Algorithms to Construct Minkowski Reduced an Hermite Reduced Lattice Bases. 125-139 - Burkhard Monien, Ivan Hal Sudborough:
Bandwidth Constrained NP-Complete Problems. 141-167 - Elias Dahlhaus, Haim Gaifman:
Concerning Two-Adjacent Context-Free Languages. 169-184 - Wolfgang Reisig:
Petri Nets with Individual Tokens. 185-213 - Juhani Karhumäki:
A Property of Three-Element Codes. 215-222 - Etsuji Tomita, Kazushi Seino:
A Weaker Sufficient Condition for the Equivalence of a Pair of DPDA's to be Decidable. 223-230 - Oscar H. Ibarra, Michael A. Palis, Sam M. Kim:
Fast Parallel Language Recognition by Cellular Automata. 231-246 - Elisabeth Pelz:
On the Complexity of Theories of Permutations. 247-269 - John Grant, Jack Minker:
Inferences for Numerical Dependencies. 271-287 - Sachio Hirokawa
:
Complexity of the Combinator Reduction Machine. 289-303 - Giora Slutzki:
Alternating Tree Automata. 305-318 - Hans-Jörg Stoß:
The Complexity of Evaluating Interpolation Polynomials. 319-323 - Friedhelm Meyer auf der Heide:
Simulating Probabilistic by Deterministic Algebraic Computation Trees. 325-330 - Katsushi Inoue, Itsuo Takanami, Roland Vollmar:
Alternating On-Line Turing Machines with Only Universal States and Small Space Bounds. 331-339
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-12-09 23:25 CET 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:
