default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheoretical Computer Science, Volume 9
Volume 9, 1979
- David A. Plaisted:
Fast Verification, Testing, and Generation of Large Primes. 1-16 - Jean-Pierre Duval:
Periodes et Repetitions des Mots du Monoide Libre. 17-26 - Jan A. Bergstra, Jan Willem Klop:
Church-Rosser Strategies in the Lambda Calculus. 27-38 - Irène Guessarian:
Program Transformations and Algebraic Semantics. 39-65 - Richard Statman:
Intuitionistic Propositional Logic is Polynomial-Space Complete. 67-72 - Richard Statman:
The Typed lambda-Calculus is not Elementary Recursive. 73-81 - Ingo Wegener:
Switching Functions Whose Monotone Complexity is Nearly Quadratic. 83-97 - Philippe Flajolet, Jean-Claude Raoult, Jean Vuillemin:
The Number of Registers Required for Evaluating Arithmetic Expressions. 99-125 - Gerd Wechsung, Andreas Brandstädt:
A Relation Between Space, Return and Dual Return Complexities. 127-140 - Gilles Christol:
Ensembles Presque Periodiques k-Reconnaissables. 141-145 - Ingo Wegener:
A Counterexample to a Conjecture of Schnorr Referring to Monotone Networks. 147-150 - A. Tang:
Chain Properties in P omega. 153-172 - Michael A. Harrison, Ivan M. Havel
, Amiram Yehudai:
On Equivalence of Grammars Through Transformation Trees. 173-205 - Juhani Karhumäki:
On Commutative DT0L Systems. 207-220 - Dominique Perrin:
La Representation Ergodique d'un Automate fini. 221-241 - Edward A. Ashcroft, Faith E. Fich:
A Generalized Setting for Fixpoint Theory. 243-256 - Stephen L. Bloom, Ralph Tindell:
Algebraic and Graph Theoretic Characterizations of Structured Flowchart Schemes. 265-286 - Anton Nijholt:
Simple Chain Grammars and Languages. 287-309 - Katsushi Inoue, Itsuo Takanami, Akira Nakamura, Tadashi Ae:
One-Way Simple Multihead Finite Automata. 311-328 - Raymond Aubin:
Mechanizing Structural Induction Part I: Formal System. 329-345 - Raymond Aubin:
Mechanizing Structural Induction Part II: Strategies. 347-362 - Christophe Reutenauer:
Sur les Series Associees a Certains Systemes de Lindenmayer. 363-375 - Keijo Ruohonen:
On Some Decidability Problems for HD0L Systems with Nonsingular Parikh Matrices. 377-384 - F. Rodriguez:
Familles de Langages Fermees par Crochet Ouvert. 385-398
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-10-31 20:04 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:
