Остановите войну!
for scientists:
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 31 matches
- 2011
- Jeffrey O. Shallit:
The Critical Exponent is Computable for Automatic Sequences. WORDS 2011: 231-239 - Narad Rampersad, Jeffrey O. Shallit, Arseny M. Shur:
Fife's Theorem for (7/3)-Powers. WORDS 2011: 189-198 - Srecko Brlek:
Interactions between Digital Geometry and Combinatorics on Words. WORDS 2011: 1-12 - Anna E. Frid:
Infinite permutations vs. infinite words. WORDS 2011: 13-19 - Juha Kortelainen:
Combinatorics on words in information security: Unavoidable regularities in the construction of multicollision attacks on iterated hash functions. WORDS 2011: 22-29 - Benoît Rittaud, Laurent Vivier:
Circular words and applications. WORDS 2011: 31-36 - Golnaz Badkobeh, Maxime Crochemore:
Finite-Repetition threshold for infinite ternary words. WORDS 2011: 37-43 - Valérie Berthé, Sébastien Labbé:
Uniformly balanced words with linear complexity and prescribed letter frequencies. WORDS 2011: 44-52 - Stefano Bilotta, Elisa Pergola, Renzo Pinzani:
Pattern 1j0i avoiding binary words. WORDS 2011: 53-64 - Bastian Bischoff, Dirk Nowotka:
Pattern Avoidability with Involution. WORDS 2011: 65-70 - Francine Blanchet-Sadri, Aleksandar Chakarov, Lucas Manuelli, Jarett Schwartz, Slater Stich:
Recurrent Partial Words. WORDS 2011: 71-82 - Fabio Burderi:
Monoids and Maximal Codes. WORDS 2011: 83-92 - Michaël Cadilhac, Alain Finkel, Pierre McKenzie:
Bounded Parikh Automata. WORDS 2011: 93-102 - Stefano Crespi-Reghizzi, Pierluigi San Pietro:
From Regular to Strictly Locally Testable Languages. WORDS 2011: 103-111 - Daniel Dombek:
Substitutions over infinite alphabet generating (-β)-integers. WORDS 2011: 115-121 - Sébastien Ferenczi:
Dynamical generalizations of the Lagrange spectrum. WORDS 2011: 122-128 - Gabriele Fici:
A Classification of Trapezoidal Words. WORDS 2011: 129-137 - Irina A. Gorbunova, Arseny M. Shur:
On Pansiot Words Avoiding 3-Repetitions. WORDS 2011: 138-146 - Vesa Halava, Tero Harju, Tomi Kärki:
A new proof for the decidability of D0L ultimate periodicity. WORDS 2011: 147-151 - Thierry Monteil:
The complexity of tangent words. WORDS 2011: 152-157 - Hossein Nevisi, Daniel Reidenbach:
Unambiguous 1-Uniform Morphisms. WORDS 2011: 158-167 - Elena A. Petrova, Arseny M. Shur:
Constructing Premaximal Binary Cube-free Words of Any Level. WORDS 2011: 168-178 - Svetlana Puzynina, Luca Q. Zamboni:
Abelian returns in Sturmian words. WORDS 2011: 179-188 - Mathieu Roux, Brigitte Vallée:
Information theory: Sources, Dirichlet series, and realistic analyses of data structures. WORDS 2011: 199-214 - Aleksi Saarela:
Systems of Word Equations and Polynomials: a New Approach. WORDS 2011: 215-225 - Matthew J. Samuel:
Word posets, with applications to Coxeter groups. WORDS 2011: 226-230 - Nikita Sidorov:
Optimizing Properties of Balanced Words. WORDS 2011: 240-246 - Wolfgang Steiner:
On the Delone property of (-β)-integers. WORDS 2011: 247-256 - Alexandr Valyuzhenich:
Permutation complexity of the fixed points of some uniform binary morphisms. WORDS 2011: 257-264 - Steven Widmer:
Permutation Complexity Related to the Letter Doubling Map. WORDS 2011: 265-276
skipping 1 more match
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-06-11 04:40 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