![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 23 matches
- 1985
- Hassan Aït-Kaci:
An Algorithm for Finding A Minimal Recursive Path Ordering. RAIRO Theor. Informatics Appl. 19(4): 359-382 (1985) - Luc Boasson:
Non-Générateurs Algébriques et Substitution. RAIRO Theor. Informatics Appl. 19(2): 125-136 (1985) - Michel Carvallo:
Sur La Minimisation D'une Expression Représentant une Famille de Fonctions Booléennes. RAIRO Theor. Informatics Appl. 19(4): 331-336 (1985) - Anton Cerný:
On A Class of Infinite Words with Bounded Repetitions. RAIRO Theor. Informatics Appl. 19(4): 337-349 (1985) - Robert Cori, Dominique Perrin:
Automates et Commutations Partielles. RAIRO Theor. Informatics Appl. 19(1): 21-32 (1985) - Jean-Paul Delahaye:
Sur Quelques Limitations des Algorithmes Dans Le Traitement des Suites. RAIRO Theor. Informatics Appl. 19(1): 3-20 (1985) - Andrzej Ehrenfeucht, Grzegorz Rozenberg:
Strong Iterative Pairs and The Regularity of Context-Free Languages. RAIRO Theor. Informatics Appl. 19(1): 43-56 (1985) - Clelia de Felice, Antonio Restivo:
Some Results On Finite Maximal Codes. RAIRO Theor. Informatics Appl. 19(4): 383-403 (1985) - Philippe Flajolet, Thomas Ottmann, Derick Wood:
Search Trees and Bubble Memories. RAIRO Theor. Informatics Appl. 19(2): 137-164 (1985) - Philippe Gohon:
Automates de Coût Borné Sur Un Alphabet A Une Lettre. RAIRO Theor. Informatics Appl. 19(4): 351-357 (1985) - Raul Kantor, Giovanna Sontacchi:
Un Interprète Lisp de La Programmation Fonctionnelle Réalisé Par des Combinateurs. RAIRO Theor. Informatics Appl. 19(1): 33-41 (1985) - Juhani Karhumäki, H. C. M. Kleijn:
On the Equivalence of Compositions of Morphisms and Inverse Morphisms on Regular Languages. RAIRO Theor. Informatics Appl. 19(3): 203-211 (1985) - Roman König:
Reduction Algorithms for Some Classes of Aperiodic Monoids. RAIRO Theor. Informatics Appl. 19(3): 233-260 (1985) - Fred Kröger:
On Temporal Program Verification Rules. RAIRO Theor. Informatics Appl. 19(3): 261-280 (1985) - Jean-Pierre Pécuchet:
Automates Boustrophedon, Semi-Groupe de Birget et Monoide Inversif Libre. RAIRO Theor. Informatics Appl. 19(1): 71-100 (1985) - Alex Pelin:
A Formalism for Treating Equivalence of Recursive Procedures. RAIRO Theor. Informatics Appl. 19(3): 293-313 (1985) - E. Pichat:
Algorithme de Décomposition de Clés. RAIRO Theor. Informatics Appl. 19(3): 213-232 (1985) - Jean-Luc Rémy:
Un Procédé Itératif de Dénombrement D'arbres Binaires et Son Application A Leur Génération Aléatoire. RAIRO Theor. Informatics Appl. 19(2): 179-195 (1985) - Christophe Reutenauer:
Sur Les Semi-Groupes Vérifiant Le Théorème de Kleene. RAIRO Theor. Informatics Appl. 19(3): 281-291 (1985) - Giuseppina Rindone:
Sur Les Groupes Syntaxiques D'un Langage. RAIRO Theor. Informatics Appl. 19(1): 57-70 (1985) - Yves Robert, Maurice Tchuenté:
Réseaux Systoliques Pour des Problèmes de Mots. RAIRO Theor. Informatics Appl. 19(2): 107-123 (1985) - Athanasios K. Tsakalidis:
Rebalancing Operations for Deletions in AVL-Trees. RAIRO Theor. Informatics Appl. 19(4): 323-329 (1985) - Max Vincent:
Construction de Codes Indécomposables. RAIRO Theor. Informatics Appl. 19(2): 165-178 (1985)
loading more results
failed to load more results, please try again later
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
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.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
retrieved on 2024-07-23 14:55 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint