default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDInformatique Théorique et Applications, Volume 20
Volume 20, Number 1, 1986
- Helmut Jürgensen, M. Kunze:
Über die Implementierung Redundanzfreier Codes zur Datenverschlüsselung. 5-30 - Tom Head:
The Topological Structure of Adherences of Regular Languages. 31-41 - Jean-Jacques Pansiot:
Decidability of Periodicity for Infinite Words. 43-46 - Tero Harju
, Matti Linna:
On the Periodicity of Morphisms on Free Monoids. 47-54 - Sheila A. Greibach, Celia Wrathall:
Single-Tape Reset Machines. 55-77 - Foto N. Afrati, Stavros S. Cosmadakis, Christos H. Papadimitriou, George Papageorgiou, Nadia Papakostantinou:
The Complexity of the Travelling Repairman Problem. 79-87 - Andrzej Ehrenfeucht, Grzegorz Rozenberg:
Each Regular Code Is Included in A Maximal Regular Code. 89-96
Volume 20, Number 2, 1986
- IJsbrand Jan Aalbersberg, Emo Welzl:
Trace Languages Defined by Regular String Languages. 103-119 - Yves Métivier:
Une Condition Suffisante de Reconnaissabilité Dans un Monoïde Partiellement Commutatif. 121-127 - Janusz A. Brzozowski, Robert Knast:
Graph Congruences and Pair Testing. 129-147 - Jacques J. Arsac:
La Fonction D'ackermann: Un Nouveau Mode de Dérécursivation. 149-156 - Patrice Séébold:
Complément A L'étude des Suites de Thue-Morse Généralisées. 157-181 - Hermann K.-G. Walter:
A Simple Proof of Valiant's Lemma. 183-190 - Pavel Goralcik, A. Goralciková, Václav Koubek:
How much Semigroup Structure is Needed to Encode Graphs? 191-206
Volume 20, Number 3, 1986
- Marco Protasi, Maurizio Talamo:
A Parametric Analysis of the Largest Induced Tree Problem in Random Graphs. 211-219 - Brigitte Rozoy:
Outils et Résultats Pour Les Transducteurs Boustrophedons. 221-249 - Max Dauchet, Erick Timmerman:
Continuous Monoids and Yields of Infinite Trees. 251-274 - Jean Françon:
Une Approche Quantitative de L'Exclusion Mutuelle. 275-289 - Philippe Darondeau:
Une Critique de La Notion de Test de Processus Fondée Sur La Non Séparabilité de Certaines Classes de Langages. 291-317 - Juha Kortelainen:
Every Commutative Quasirational Language is Regular. 319-337 - Alex Weiss:
The Local And Global Varieties Induced by Nilpotent Monoids. 339-355 - Alex Weiss, Denis Thérien:
Varieties of Finite Categories. 357-366
Volume 20, Number 4, 1986
- Wolfgang Thomas:
On Frontiers of Regular Trees. 371-381 - Choun Tong Lieu:
Point-Fixe Sur Un Ensemble Restreint. 383-394 - Juha Honkala:
A Decision Method for The Recognizability of Sets Defined by Number Systems. 395-403 - Andrzej Ehrenfeucht, Hendrik Jan Hoogeboom, Grzegorz Rozenberg:
Coordinated Pair Systems; Part I: Dyck Works and Classical Pumping. 405-424 - Andrzej Ehrenfeucht, Hendrik Jan Hoogeboom, Grzegorz Rozenberg:
Coordinated Pair Systems; Part II: Sparse Structure of Dyck Words and Ogden's Lemma. 425-439 - Jean-Jacques Hébrard, Maxime Crochemore:
Calcul de La Distance Par Les Sous-Mots. 441-456 - R. Boonyavatana, Giora Slutzki:
Ogden's Lemma for Monterminal Bounded Languages. 457-471 - Didier Arquès:
Dénombrements de Chemins Dans -Real 2 Soumis A Contraintes. 473-482 - Ludwig Staiger:
On Infinitary Finite Length Codes. 483-494
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-03 23:18 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:
