default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheoretical Computer Science, Volume 275
Volume 275, Number 1-2, March 2002
- Mingsheng Ying
:
Bisimulation indexes and their applications. 1-68 - Bruce S. Burdick:
A note on iterated duals of certain topological spaces. 69-77 - Ernest G. Manes:
Taut Monads and T0-spaces. 79-109 - Alexander Moshe Rabinovich:
Finite variability interpretation of monadic logic of order. 111-125 - Nadia Busi:
Analysis issues in Petri nets with inhibitor arcs. 127-177 - Serge Abiteboul, Sophie Cluet, Tova Milo:
Correspondence and translation for heterogeneous data. 179-213 - Dominic Duggan, John Ophel:
Open and closed scopes for constrained genericity. 215-258 - Pierpaolo Degano, Fabio Gadducci, Corrado Priami:
A causal semantics for CCS via rewriting logic. 259-282 - Iain A. Stewart:
Program schemes, arrays, Lindström quantifiers and zero-one laws. 283-310 - Igor Walukiewicz:
Monadic second-order logic on tree-like structures. 311-346 - Danièle Beauquier, Anatol Slissenko:
Decidable verification for reducible timed automata specified in a first order logic with time. 347-388 - Maria I. Sessa:
Approximate reasoning by similarity-based SLD resolution. 389-426 - Jirí Adámek, Michel Hébert, Jirí Rosický:
On abstract data types presented by multiequations. 427-462 - Sergei G. Vorobyov:
forall-Exists5-equational theory of context unification is undecidable. 463-479 - Mingsheng Ying:
Additive models of probabilistic processes. 481-519 - Agostino Cortesi, Agostino Dovier, Elisa Quintarelli, Letizia Tanca:
Operational and abstract semantics of the query language G-Log. 521-560 - Ernst Zimmermann:
Peirce's Rule in Natural Deduction. 561-574 - Felice Cardone:
A coinductive completeness proof for the equivalence of recursive types. 575-587 - Walter Vogler:
Efficiency of asynchronous systems, read arcs, and the MUTEX-problem. 589-631 - Frank Neven, Thomas Schwentick:
Query automata over finite trees. 633-674 - Adel Bouhoula, Michaël Rusinowitch:
Observational proofs by rewriting. 675-698
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-28 20:30 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:
