default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheoretical Computer Science, Volume 10
Volume 10, 1980
- Claus-Peter Schnorr, Jean-Paul Van de Wiele:
On the Additive Complexity of Polynomials. 1-18 - Janusz A. Brzozowski, Ernst L. Leiss:
On Equations for Regular Languages, Finite Automata, and Sequential Networks. 19-35 - Petr Kurka
:
Applicability of a Production in a Categorical Grammar. 37-44 - Andrzej Ehrenfeucht, Grzegorz Rozenberg:
Every Two Equivalent D0L Systems have a Regular True Envelope. 45-52 - Werner Hartmann, Peter Schuster:
Multiplicative Complexity of some Rational Functions. 53-61 - Shmuel Zaks:
Lexicographic Generation of Ordered Trees. 63-82 - Claus-Peter Schnorr:
A 3n-Lower Bound on the Network Complexity of Boolean Functions. 83-92 - Joachim Biskup:
Inferences of Multivalued Dependencies in Fixed and Undetermined Universes. 93-105 - Helmut Prodinger:
On the Interpolation of D0L-Sequences. 107-108 - Steven Fortune, John E. Hopcroft, James Wyllie:
The Directed Subgraph Homeomorphism Problem. 111-121 - Karl J. Lieberherr:
P-Optimal Heuristics. 123-131 - E. Wiedmer:
Computing with Infinite Objects. 133-155 - Aldo de Luca, Antonio Restivo:
On Some Properties of Very Pure Codes. 157-170 - John Staples:
Computation on Graph-Like Expressions. 171-185 - Ivan M. Havel:
On Branching and Looping, Part I. 187-220 - Dexter Kozen:
Complexity of Boolean Algebras. 221-247 - Rina S. Cohen, Arie Y. Gold:
On the Complexity of omega-Type Turing Acceptors. 249-272 - Ivan M. Havel:
On Branching and Looping, Part II. 273-295 - John Staples:
Optimal Evaluations of Graph-Like Expressions. 297-316 - K. N. King:
Iteration Theorems for Families of Strict Deterministic Languages. 317-333 - Michael Sipser:
Halting Space-Bounded Computations. 335-338
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-10-22 02:16 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:
