default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDInformatique Théorique et Applications, Volume 35
Volume 35, Number 1, January-February 2001
- Corina Cîrstea:
Integrating Observational and Computational Features in the Specification of State-Based, Dynamical Systems. 1-29 - Bart Jacobs:
Many-Sorted Coalgebraic Modal Logic: a Model-theoretic Study. 31-59 - Erik Poll:
A Coalgebraic Semantics of Subtyping. 61-81 - Hendrik Tews:
Coalgebras for Binary Methods: Properties of Bisimulations and Invariants. 83-111
Volume 35, Number 2, March-April 2001
- Mark Levene, George Loizou:
A Generalisation of Entity and Referential Integrity in Relational Databases. 113-127 - François Denis, Rémi Gilleron:
PAC Learning under Helpful Distributions. 129-148 - Beate Bollig:
Restricted Nondeterministic Read-Once Branching Programs and an Exponential Lower Bound for Integer Multiplication. 149-162 - Jérémie Bourdon
, Markus E. Nebel, Brigitte Vallée:
On the Stack-Size of General Tries. 163-185 - Rudolf Grübel, Anke Reimers:
On the number of iterations required by Von Neumann addition. 187-206
Volume 35, Number 3, May-June 2001
- Samir Farkh, Karim Nour:
Les types de données syntaxiques du système F. 207-221 - Karim Nour:
Les I-types du système F. 223-237 - Kenichi Morita, Katsunobu Imai:
Number-Conserving Reversible Cellular Automata and Their Computation-Universality. 239-258 - Andrew Chiu, George I. Davida, Bruce E. Litow:
Division in logspace-uniform NC1. 259-275 - Jan Johannsen:
Depth Lower Bounds for Monotone Semi-Unbounded Fan-in Circuits. 277-286 - Sounaka Mishra, Kripasindhu Sikdar:
On the Hardness of Approximating Some NP-optimization Problems Related to Minimum Linear Ordering Problem. 287-309
Volume 35, Number 4, July-August 2001
- Salvatore La Torre, Margherita Napoli:
Automata-based Representations for Infinite Graphs. 311-330 - Habib Abdulrab, Pavel Goralcik, G. S. Makanin:
Towards parametrizing word equations. 331-350 - Yannick Guesnet:
Maximal circular codes versus maximal codes. 351-365 - Patrizio Cintioli, Riccardo Silvestri:
The Helping Hierarchy. 367-377 - Joanna Jedrzejowicz, Andrzej Szepietowski:
On the expressive power of the shuffle operator matched with intersection by regular sets. 379-388 - Werner Kuich, Norbert Sauer:
Atoms and partial orders of infinite languages. 389-401
Volume 35, Number 5, September-October 2001
- A. Veloso da Costa:
On graph products of automatic monoids. 403-417 - Manuel Delgado:
Commutative images of rational languages and the Abelian kernel of a monoid. 419-435 - Francis Wlazinski:
A test-set for k-power-free binary morphisms. 437-452 - Stepan Holub, Juha Kortelainen:
Linear size test sets for certain commutative languages. 453-475 - Carlo Mereghetti, Beatrice Palano, Giovanni Pighizzini:
Note on the Succinctness of Deterministic, Nondeterministic, Probabilistic and Quantum Finite Automata. 477-490
Volume 35, Number 6, November-December 2001
- Jean Berstel:
An Exercise on Fibonacci Representations. 491-498 - Alberto Bertoni, Massimiliano Goldwurm, Massimo Santini:
Random Generation for Finitely Ambiguous Context-free Languages. 499-512 - Arturo Carpi, Cristiano Maggi:
On synchronized sequences and their separators. 513-524 - Olivier Carton, Christian Choffrut:
Periodicity and roots of transfinite strings. 525-533 - Julien Cassaigne, Juhani Karhumäki, Ján Manuch:
On Conjugacy of Languages. 535-550 - Alexandru Mateescu, Arto Salomaa, Kai Salomaa, Sheng Yu:
A sharpening of the Parikh mapping. 551-564 - Filippo Mignosi, Antonio Restivo, Marinella Sciortino:
Forbidden Factors and Fragment Assembly. 565-577 - Alair Pereira do Lago, Imre Simon:
Free Burnside Semigroups. 579-595 - Jean-Eric Pin, Pascal Weil:
A conjecture on the concatenation product. 597-618
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-15 19:22 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:
