default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDInformatique Théorique et Applications, Volume 37
Volume 37, Number 1, January-March 2003
- Julian C. Bradfield:
Fixpoints, games and the difference hierarchy. 1-15 - Ludwik Czaja:
On the Analysis of Petri Nets and their Synthesis from Process Languages. 17-38 - Mika Hirvensalo, Sebastian Seibert:
Lower Bounds for Las Vegas Automata by Information Theory. 39-49 - Beate Bollig:
Complexity Theoretical Results on Nondeterministic Graph-driven Read-Once Branching Programs. 51-66 - Victor L. Selivanov:
Wadge Degrees of [omega]-Languages of Deterministic Turing Machines. 67-83 - Gwénaël Richomme:
Some algorithms to compute the conjugates of Episturmian morphisms. 85-104
Volume 37, Number 2, April-June 2003
- Olivier Finkel:
On the Topological Complexity of Infinitary Rational Relations. 105-113 - Olivier Finkel:
Undecidability of Topological and Arithmetical Properties of Infinitary Rational Relations. 115-126 - Nadia Creignou, Hervé Daudé:
Smooth and sharp thresholds for random k-XOR-CNF satisfiability. 127-147 - Juha Honkala:
A bound for the [omega]-equivalence problem of polynomial D0L systems. 149-157 - Norbert Popély:
The Communication Hierarchy of Time and Space Bounded Parallel Machines. 159-176
Volume 37, Number 3, July-September 2003
- Zoltán Ésik, Kim Guldstrand Larsen:
Regular languages definable by Lindström quantifiers. 179-241 - Michal Kunc:
Equational description of pseudovarieties of homomorphisms. 243-254 - Ján Manuch, Ladislav Stacho:
On f-wise Arc Forwarding Index and Wavelength Allocations in Faulty All-optical Hypercubes. 255-270
Volume 37, Number 4, October-December 2003
- Zoltán Ésik, Anna Ingólfsdóttir:
Foreword. RAIRO Theor. Informatics Appl. 37(4): 272 (2003) - Nick Benton, Martin Hyland:
Traced Premonoidal Categories. 273-299 - Federico De Marchi, Neil Ghani, Christoph Lüth:
Solving Algebraic Equations Using Coalgebra. 301-314 - Tarmo Uustalu
:
Generalizing Substitution. 315-336 - Guo-Qiang Zhang:
Domain µ-calculus. 337-364 - Christoph Sprenger, Mads Dam:
On global induction mechanisms in a µ-calculus with explicit approximations. 365-391
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-30 00: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:
