default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheoretical Computer Science, Volume 17
Volume 17, 1982
- Meera Blattner, Seymour Ginsburg:
Position-Restricted Grammar Forms and Grammars. 1-27 - Emo Welzl:
Color-Families are Dense. 29-41 - Esko Ukkonen:
Structure Preserving Elimination of Null Productions from Context-Free Grammars. 43-54 - Eitan M. Gurari, Oscar H. Ibarra:
Some Simplified Undecidable and NP-Hard Problems for Simple Programs. 55-73 - Juris Hartmanis:
A Note on Natural Complete Sets and Gödel Numberings. 75-89 - Maciej M. Syslo:
The Subgraph Isomorphism Problem for Outerplanar Graphs. 91-97 - Marek Karpinski:
Decidability of "Skolem Matrix Emptiness Problem" Entails Constructability of Exact Regular Expression. 99-102 - Wolf-Dietrich Fellner
:
On Minimal Graphs. 103-110 - Jean H. Gallier:
Corrigendum: DPDA's in "Atomic Normal Form" and Applications to Equivalence Problems. TCS 14(1981) 155-186. Theor. Comput. Sci. 17: 111 (1982) - Jan A. Bergstra, Jerzy Tiuryn, John V. Tucker:
Floyds Principle, Correctness Theories and Program Equivalence. 113-149 - Daniel Lehmann, Ana Pasztor:
Epis need not be Dense. 151-161 - Bruno Courcelle, Paul Franchi-Zannettacci:
Attribute Grammars and Recursive Program Schemes I. 163-191 - Hajnal Andréka, István Németi, Ildikó Sain:
A Complete Logic for Reasoning about Programs via Nonstandard Model Theory I. 193-212 - Ronald D. Dutton, Robert C. Brigham:
The Complexity of a Multiprocessor Task Assignment Problem without Deadlines. 213-216 - John C. Shepherdson:
Graph Theoretic Characterization of G-Schemes and TL-Schemes. Theor. Comput. Sci. 17: 217-228 (1982) - Craig C. Squier, Celia Wrathall:
A Note on Representations of a Certain Monoid. 229-231 - Bruno Courcelle, Paul Franchi-Zannettacci:
Attribute Grammars and Recursive Program Schemes II. 235-257 - Hajnal Andréka, István Németi, Ildikó Sain:
A Complete Logic for Reasoning about Programs via Nonstandard Model Theory II. 259-278 - Nachum Dershowitz:
Orderings for Term-Rewriting Systems. 279-301 - Jan A. Bergstra, John V. Tucker:
Some Natural Structures which Fail to Possess a Sound and Decidable Hoare-Like Logic for their While-Programs. 303-315 - Fereidoon Sadri, Jeffrey D. Ullman:
The Theory of Functional and Template Dependencies. 317-331 - R. K. Shyamasundar:
On a Characterization of Pushdown Permuters. 333-341 - István Németi:
Every Free Algebra in the Variety Generated by the Representable Dynamic Algebras is Separable and Representable. 343-347
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:
