default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheoretical Computer Science, Volume 63
Volume 63, Number 1, 1989
- Ursula Schmidt:
Avoidable Patterns on Two Letters. 1-17 - Mike Livesey:
Stable Families of Behavioural Equivalences. 19-41 - Klaus Ambos-Spies:
On the Relative Complexity of Hard Problems for Complexity Classes without Complete Problems. 43-61 - Seymour Ginsburg, Chang-jie Tang:
Cohesion of Object Histories. 63-90 - J. Howard Johnson:
A Unified Framework for Disambiguating Finite Transductions. 91-111
Volume 63, Number 2, 1989
- Masami Hagiya:
Generalization from Partial Parametrization in Higher-Order Type Theory. 113-139 - Jean-Camille Birget:
Concatenation of Inputs in a Two-Way Automaton. 141-156 - Clelia de Felice
:
Construction of a Family of Finite Maximal Codes. 157-184 - Andrzej Pelc:
Searching with Known Error Probability. 185-202 - Juraj Hromkovic:
Tradeoffs for Language Recognition on Alternating Machines. 203-221 - Takashi Saito, Hidenosuke Nishio:
Structural and Behavioral Equivalence Relations in Automata Networks. 223-237
Volume 63, Number 3, 1989
- Ding-Zhu Du, Ronald V. Book:
On Inefficient Special Cases of NP-Complete Problems. 239-252 - Georges Gardarin, Irène Guessarian, Christophe de Maindreville:
Translation of Logic Programs into Functional Fixpoint Equations. 253-274 - David B. Benson, Jerzy Tiuryn:
Fixed Points in Free Process Algebras, Part I. 275-294 - Andrzej Lingas:
Subgraph Isomorphism for Biconnected Outerplanar Graphs in Cubic Time. 295-302 - Stephen L. Bloom, Zoltán Ésik:
Equational Logic of Circular Data Type Specification. 303-331 - Aldo de Luca, Stefano Varricchio:
Some Combinatorial Properties of the Thue-Morse Sequence and a Problem in Semigroups. 333-348
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-11-08 20:19 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:
