default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheoretical Computer Science, Volume 40
Volume 40, 1985
- Juhani Karhumäki:
On Three-Element Codes. 3-11 - Antonio Restivo, Christophe Reutenauer:
Rational Languages and the Burnside Problem. 13-30 - Anselm Blumer, J. Blumer, David Haussler, Andrzej Ehrenfeucht, M. T. Chen, Joel I. Seiferas:
The Smallest Automaton Recognizing the Subwords of a Text. 31-55 - Uwe Schöning:
Robust Algorithms: A Different Approach to Oracles. 57-66 - Robert Paige, Robert Endre Tarjan, Robert Bonic:
A Linear Time Solution to the Single Function Coarsest Partition Problem. 67-84 - G. Bauer:
n-Level Rewriting Systems. 85-99 - Ronald V. Book, Friedrich Otto:
On the Verifiability of Two-Party Algebraic Protocols. 101-130 - Walter Bucher, Andrzej Ehrenfeucht, David Haussler:
On Total Regulators Generated by Derivation Relations. 131-148 - IJsbrand Jan Aalbersberg
, Grzegorz Rozenberg:
CTS Systems and Petri Nets. 149-162 - Kathleen Ayers:
Deque Automata and a Subfamily of Context-Sensitive Languages which Contains all Semilinear Bounded Languages. 163-174 - Kojiro Kobayashi:
On the structure of one-tape nondeterministic turing machine time hierarchy. 175-193 - Ming-Deh A. Huang, Karl J. Lieberherr:
Implications of Forbidden Structures for Extremal Algorithmic Problems. 195-210 - Gianfranco Mascari, Marisa Venturini Zilli:
While-Programs with Nondeterministic Assignments and the Logic Alna. 211-235 - José L. Balcázar, Ronald V. Book, Uwe Schöning:
On Bounded Query Machines. 237-243 - Taiho Kanaoka, Shingo Tomita:
Homogeneous Decomposition of Stochastic Systems. 245-255 - S. Kamal Abdali, B. David Saunders:
Transitive Closure and Related Semiring Properties via Eliminants. 257-274 - Françoise Fogelman-Soulié:
Parallel and Sequential Computation on Boolean Networks. 275-300 - Abraham Ginzburg, Michael Yoeli:
Reducibility of Synchronization Structures. 301-314 - Friedrich J. Urbanek:
On Greibach Normal Form Construction. 315-317 - Michael Kaminski:
A Lower Bound for Polynomial Multiplication. 319-322 - Mukkai S. Krishnamoorthy, Paliath Narendran:
On Recursive Path Ordering. 323-328 - Georges Gonthier:
Algebraic Calculi of Processes and Net Expressions. 329-337
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-04 22:08 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:
