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 29 matches
- 2014
- Marco Almeida, Nelma Moreira, Rogério Reis:
Incremental DFA minimisation. RAIRO Theor. Informatics Appl. 48(2): 173-186 (2014) - Ivone Amorim, António Machiavelo, Rogério Reis:
On the invertibility of finite linear transducers. RAIRO Theor. Informatics Appl. 48(1): 107-125 (2014) - Nathalie Aubrun, Marie-Pierre Béal:
Tree algebra of sofic tree languages. RAIRO Theor. Informatics Appl. 48(4): 431-451 (2014) - Golnaz Badkobeh, Maxime Crochemore, Michaël Rao:
Finite repetition threshold for large alphabets. RAIRO Theor. Informatics Appl. 48(4): 419-430 (2014) - Parsa Bakhtary, Othman Echi:
On minimal Hamming compatible distances. RAIRO Theor. Informatics Appl. 48(5): 495-503 (2014) - Valérie Berthé, Timo Jolivet, Anne Siegel:
Connectedness of fractals associated with Arnoux-Rauzy substitutions. RAIRO Theor. Informatics Appl. 48(3): 249-266 (2014) - Francine Blanchet-Sadri, Benjamin De Winkle, Sean Simmons:
Abelian pattern avoidance in partial words. RAIRO Theor. Informatics Appl. 48(3): 315-339 (2014) - Hans-Joachim Böckenhauer, Monika Steinová:
Improved approximations for ordered TSP on near-metric graphs. RAIRO Theor. Informatics Appl. 48(5): 479-494 (2014) - Thomas Brodag, Steffen Herbold, Stephan Waack:
A Generalized Model of PAC Learning and its Applicability. RAIRO Theor. Informatics Appl. 48(2): 209-245 (2014) - Pascal Caron, Jean-Marc Champarnaud, Ludovic Mignot:
A general framework for the derivation of regular expressions. RAIRO Theor. Informatics Appl. 48(3): 281-305 (2014) - Jürgen Dassow, Stefan Rudolf:
Conditional Lindenmayer systems with subregular conditions: The non-extended case. RAIRO Theor. Informatics Appl. 48(1): 127-147 (2014) - Anna E. Frid, Damien Jamet:
The number of binary rotation words. RAIRO Theor. Informatics Appl. 48(4): 453-465 (2014) - Markus Holzer, Bianca Truthe:
Preface. RAIRO Theor. Informatics Appl. 48(1): 1-2 (2014) - Norbert Hundeshagen, Peter Leupold:
Transducing by observing length-reducing and painter rules. RAIRO Theor. Informatics Appl. 48(1): 85-105 (2014) - Mari Huova:
Existence of an infinite ternary 64-abelian square-free word. RAIRO Theor. Informatics Appl. 48(3): 307-314 (2014) - Raphaël M. Jungers, Véronique Bruyère, Romain Hollanders, Michel Rigo:
Special issue in the honor of the 14th "Journées Montoises d'Informatique Théorique" - Foreword. RAIRO Theor. Informatics Appl. 48(3): 247 (2014) - Martin Kutrib, Matthias Wendlandt:
Bidirectional string assembling systems. RAIRO Theor. Informatics Appl. 48(1): 39-59 (2014) - Michel Latteux, Yves Roos:
One-Rule Length-Preserving Rewrite Systems and Rational Transductions. RAIRO Theor. Informatics Appl. 48(2): 149-171 (2014) - Min Chih Lin, Michel J. Mizrahi:
Domination problems on P5-free graphs. RAIRO Theor. Informatics Appl. 48(5): 541-549 (2014) - Gerhard Lischke:
Root clustering of words. RAIRO Theor. Informatics Appl. 48(3): 267-280 (2014) - Zuzana Masáková, Tomás Vávra:
Integers in number systems with positive and negative quadratic Pisot base. RAIRO Theor. Informatics Appl. 48(3): 341-367 (2014) - Robert Mercas, Pascal Ochem, Alexey V. Samsonov, Arseny M. Shur:
Binary patterns in binary cube-free words: Avoidability and growth. RAIRO Theor. Informatics Appl. 48(4): 369-389 (2014) - Robert Mercas, Aleksi Saarela:
5-Abelian cubes are avoidable on binary alphabets. RAIRO Theor. Informatics Appl. 48(4): 467-478 (2014) - Philippe Narbel:
Bouquets of circles for lamination languages and complexities. RAIRO Theor. Informatics Appl. 48(4): 391-418 (2014) - Fumiya Okubo:
Reaction automata working in sequential manner. RAIRO Theor. Informatics Appl. 48(1): 23-38 (2014) - Friedrich Otto, Peter Cerno, Frantisek Mráz:
On the classes of languages accepted by limited context restarting automata. RAIRO Theor. Informatics Appl. 48(1): 61-84 (2014) - Daniel Prusa, Frantisek Mráz, Friedrich Otto:
Two-dimensional Sgraffito automata. RAIRO Theor. Informatics Appl. 48(5): 505-539 (2014) - Marcel Vollweiler, Friedrich Otto:
Systems of parallel communicating restarting automata. RAIRO Theor. Informatics Appl. 48(1): 3-22 (2014) - Shenggen Zheng, Jozef Gruska, Daowen Qiu:
On the state complexity of semi-quantum finite automata. RAIRO Theor. Informatics Appl. 48(2): 187-207 (2014)
loading more results
failed to load more results, please try again later
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-10-04 14:59 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