default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDInformatique Théorique et Applications, Volume 24
Volume 24, 1990
- Jean-Paul Allouche, F. Dress:
Tours de Hanoï et automates. 1-15 - J.-C. Fournier:
Pour en finir avec la dérécursivation du problème de Tours de Hanoï. 17-35 - Edward Ochmanski, Wojciech Penczek:
Inevitability in diamond processes. 37-46 - Jean-Camille Birget:
Two-way automaton computations. 47-66 - Do Long Van, D. Gnanaraj Thomas, K. G. Subramanian, Rani Siromoney:
Bi-infinitary codes. 67-87 - Rainer Parchmann, Jürgen Duske:
The structure of index sets and reduced indexed grammars. 89-104 - Habib Abdulrab:
Solving word equations. 109-130 - Pierre Jouvelot, Paul Feautrier:
Parallélisation sémantique. 131-159 - A. Paugam:
Résolution du problème de l'ellipse et du cercle par l'algorithme de Hörmander. 161-188 - Carlo Gaibisso, Giorgio Gambosi, Maurizio Talamo:
A partially persistent data structure for the set-union problem. 189-202 - Aldo de Luca, Stefano Varricchio:
A combinatorial theorem on p-power-free words and an application to semigroups. 205-228 - Ker-I Ko:
A note on separating the relativized polynomial time hierarchy by immune sets. 229-240 - Masoud T. Milani, David A. Workman:
Epsilon weak precedence grammars and languages. 241-266 - Joost Engelfriet, George Leih:
Complexity of boundary graph languages. 267-274 - Laurent Pierre, Jean-Marc Farinone:
Context-free languages with rational index in Theta(nlambda) for algebraic numbers lambda. 275-322 - Karel Culík II, Juhani Karhumäki:
Loops in automata and HDTOL relations. 327-337 - Didier Caucal:
Graphes canoniques de graphes algébriques. 339-352 - Carole Delporte-Gallet, Hugues Fauconnier, Maurice Nivat:
Parallélisation d'algorithmes avec un nombre fixe de processeurs. 353-386 - Guy Viry:
Factorisation sur Z[X] des polynômes de degré élevé à l'aide d'un monomorphisme. 387-407 - Giovanna Guaiana, Antonio Restivo, Sergio Salemi:
Complete subgraphs of bipartite graphs and applications to trace languages. 409-417 - Maurice Boffa:
Une remarque sur les systèmes complets d'identités rationnelles. 419-423 - G. Gagliardi, Sauro Tulipani:
On algebraic specifications of computable algebras with the discriminator technique. 429-440 - Nguyen Huong Lam, Do Long Van:
On a class of infiinitary codes. 441-458 - Jean Néraud
:
Elementariness of a finite set of words is co-NP-complete. 459-470 - Ulrich Huckenbeck:
On geometric automata which can nondeterminstically choose auxiliary points. 471-487 - Manfred Kudlek:
Comparison of basic language generating devices (non-deterministic systems). 489-508 - Robert Cori, Maria Rosaria Formisano:
Partially Abelian squarefree words. 509-520 - Francine Blanchet-Sadri:
On dot-depth two. 521-529 - François Morain, J. Olivos:
Speeding up the computations on an elliptic curve using addition-subtraction chains. 531-543 - Bertrand Le Saëc:
Saturating right congruences. 545-559 - Laureano González-Vega, Henri Lombardi, Tomás Recio, Marie-Françoise Roy:
Spécialisation de la suite de Sturm et sous-résulants. 561-588
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 2025-01-28 22: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:
