


default search action
Theoretical Computer Science, Volume 120
Volume 120, Number 1 1993
- Emanuel Knill, Philip T. Cox, Tomasz Pietrzykowski:

Equality and Abductive Residua for Horn Clauses. 1-44 - Giancarlo Nota

, Sergio Orefice
, Giuliano Pacini, F. Ruggiero, Genoveffa Tortora:
Legality Concepts for Three-Valued Logic Programs. 45-68 - Michal Grabowski:

On the Status of Proving Program Properties in Effective Interpretations. 69-81 - Stefano Baratella

:
A Class of Programs for which SLDNF Resolution and NAF Rule are Complete. 83-99 - Paul Gastin, Brigitte Rozoy:

The Poset of Infinitary Traces. 101-121 - Patrick Cousot, Radhia Cousot:

"A la Burstall" Intermittent Assertions Induction Principles for Proving Inevitable Ability Properties of Programs. 123-155 - Wenhui Zhang:

Cut-Formulas in Propositional Logic. 157-168
Volume 120, Number 2 1993
- Yves Marcoux:

Composition is Almost (but not Quite) as Good as s-1-1. 169-195 - Anne Brüggemann-Klein:

Regular Expressions into Finite Automata. 197-213 - Gen-Huey Chen, Biing-Feng Wang, Hungwen Li:

Deriving Algorithms on Reconfigurable Networks Based on Function Decomposition. 215-227 - Juha Honkala:

On D0L Systems with Immigration. 229-245 - Changwook Kim, Dong Hoon Lee:

Separating k-Separated eNCE Graph Languages. 247-259 - Subbiah Rajanarayanan, S. Sitharama Iyengar

, Sridhar Radhakrishnan, Rangasami L. Kashyap:
An Optimal Distributed Algorithm for Recognizing Mesh-Connected Networks. 261-278 - Bin Fu, Hong-Zhou Li:

On Symmetric Differences of NP-Hard Sets with Weakly P-Selective Sets. 279-291 - Gheorghe Paun, Arto Salomaa:

Closure Properties of Slender Languages. 293-301 - Klaas Sikkel:

Parallel On-Line Parsing in Constant Time per Word. 303-310 - Afonso Ferreira:

On Space-Efficient Algorithms for Certain NP-Complete Problems. 311-315

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.


Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID














