default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheoretical Computer Science, Volume 35
Volume 35, 1985
- Klaus-Jörn Lange, Emo Welzl:
Recurrent Words and Simultaneous Growth in T0L Systems. 1-15 - Jacques Stern:
Characterizations of Some Classes of Regular Events. 17-42 - Stephen L. Bloom, Douglas R. Troeger:
A Logical Characterization of Observation Equivalence. 43-53 - Herbert Edelsbrunner:
Finding Transversals for Sets of Simple Geometric Figures. 55-69 - Yves Métivier:
Calcul de Longueurs de Chaînes de Réécriture dans le Monoïde Libre. 71-87 - Christophe Benoit:
Axiomatisation des Tests. 89-107 - Deepak Kapur, Mukkai S. Krishnamoorthy, Robert McNaughton, Paliath Narendran:
An O(|T|3) Algorithm for Testing the Church-Rosser Property of Thue Systems. 109-114 - Jean-Pierre Pécuchet:
Automates Boustrophédon et Mots Infinis. 115-122 - Laurent Fribourg:
A Superposition Oriented Theorem Prover. 129-164 - Giorgio Ausiello, Alessandro D'Atri, Marina Moscarini
:
On the Existence of Acyclic Views in a Database Scheme. 165-177 - Robert Cori, Yves Métivier:
Recognizable Subsets of Some Partially Abelian Monoids. 179-189 - Gérard Memmi, Alain Finkel:
An Introduction to Fifo Nets-Monogeneous Nets: A Subclass of Fifo Nets. 191-214 - Kojiro Kobayashi:
On Proving Time Constructibility of Functions. 215-225 - Paliath Narendran, Friedrich Otto:
Complexity Results on the Conjugacy Problem for Monoids. 227-243 - David A. Plaisted:
Complete Divisibility Problems for Slowly Utilized Oracles. 245-260 - Sadaki Hirose, Satoshi Okawa, Masaaki Yoneda:
A Homomorphic Characterization of Recursively Enumerable Languages. 261-269 - Jean-Eric Pin, Jacques Sakarovitch:
Une Application de la Representation Matricielle des Transductions. 271-293 - Tom Head, John Wilkinson:
Code Properties and Homomorphisms of D0L Systems. 295-312 - Ernst L. Leiss:
On Classes of Tractable Unrestricted Regular Expressions. 313-327 - Michio Oyamaguchi:
On the Data Type Extension Problem for Algebraic Specifications. 329-336 - Deepak Kapur, Paliath Narendran:
A Finite Thue System with Decidable Word Problem and without Equivalent Finite Canonical System. 337-344 - Ildikó Sain:
A Simple Proof for the Completeness of Floyd's Method. 345-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-10-31 20:16 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:
