default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch 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 19 matches
- 1985
- Maurice Nivat, Dominique Perrin:
Automata on Infinite Words, Ecole de Printemps d'Informatique Théorique, Le Mont Dore, France, May 14-18, 1984. Lecture Notes in Computer Science 192, Springer 1985, ISBN 3-540-15641-0 [contents] - 1984
- André Arnold:
Deterministic and non ambiguous rational omega-languages. Automata on Infinite Words 1984: 18-27 - Danièle Beauquier:
Ensembles reconnaissables de mots bi -infinis limite et déterminisme. Automata on Infinite Words 1984: 28-46 - François Blanchard, Georges Hansel:
Languages and subshifts. Automata on Infinite Words 1984: 138-146 - Jean-Pierre Braquelaire, Bruno Courcelle:
The solution of two star height problems for regular trees. Automata on Infinite Words 1984: 108-117 - Philippe Darondeau, Laurent Kott:
A formal proof system for infinitary rational expressions. Automata on Infinite Words 1984: 68-80 - Max Dauchet, Erick Timmerman:
Decidability of yield's equality for infinite regular trees. Automata on Infinite Words 1984: 118-136 - Tom Head:
The adherences of languages as topological spaces. Automata on Infinite Words 1984: 147-163 - Kojiro Kobayashi, Masako Takahashi, Hideki Yamasaki:
Logical formulas and four subclasses of omega-regular languages. Automata on Infinite Words 1984: 81-88 - Michel Leconte:
K-th power free codes. Automata on Infinite Words 1984: 172-187 - David E. Muller, Paul E. Schupp:
Alternating automata on infinite objects, determinacy and Rabin's theorem. Automata on Infinite Words 1984: 100-107 - Jean-Jacques Pansiot
:
On various classes of infinite words obtained by iterated mappings. Automata on Infinite Words 1984: 188-197 - Jean-Pierre Pécuchet:
Automates boustrophédon sur des mots infinis. Automata on Infinite Words 1984: 47-54 - Dominique Perrin:
An introduction to finite automata on infinite words. Automata on Infinite Words 1984: 2-17 - Jean-Eric Pin:
Star free omega-languages and first order logic. Automata on Infinite Words 1984: 56-67 - G. Rauzy:
Mots infinis en arithmétique. Automata on Infinite Words 1984: 165-171 - Antonio Restivo, Sergio Salemi:
Overlap-free words on two symbols. Automata on Infinite Words 1984: 198-206 - Patrice Séébold:
Overlap-free sequences. Automata on Infinite Words 1984: 207-215 - M. W. Shields:
Deterministic asynchronous automata. Automata on Infinite Words 1984: 89-98
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-11-08 14:56 CET 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
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:
