Остановите войну!
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 33 matches
- 1999
- Jean Berstel:
On the Index of Sturmian Words. Jewels are Forever 1999: 287-294 - Janusz A. Brzozowski, Helmut Jürgensen:
Semilattices of Fault Semiautomata. Jewels are Forever 1999: 3-15 - Cristian Calude, Richard J. Coles:
Program-Size Complexity of Initial Segments and Domination Reducibility. Jewels are Forever 1999: 225-237 - Arturo Carpi, Aldo de Luca:
Repetitions and Boxes in Words and Pictures. Jewels are Forever 1999: 295-306 - Christian Choffrut, Serge Grigorieff:
Uniformization of Rational Relations. Jewels are Forever 1999: 59-71 - Karel Culík II:
Small Aperiodic Sets of Triangular and Hexagonal Tiles. Jewels are Forever 1999: 307-313 - Jürgen Dassow:
Numerical Parameters of Evolutionary Grammars. Jewels are Forever 1999: 171-181 - Volker Diekert, John Michael Robson:
Quadratic Word Equations. Jewels are Forever 1999: 314-326 - Joost Engelfriet, Hendrik Jan Hoogeboom:
Tree-Walking Pebble Automata. Jewels are Forever 1999: 72-83 - Dora Giammarresi, Jean-Luc Ponty, Derick Wood:
Thompson Languages. Jewels are Forever 1999: 16-24 - Vesa Halava, Tero Harju:
Languages Accepted by Integer Weighted Finite Automata. Jewels are Forever 1999: 123-134 - Juha Honkala:
A Power Series Approach to Bounded Languages. Jewels are Forever 1999: 135-144 - Juraj Hromkovic:
Stability of Approximation Algorithms and the Knapsack Problem. Jewels are Forever 1999: 238-249 - Oscar H. Ibarra, Jianwen Su:
Counter Machines: Decision Problems and Applications. Jewels are Forever 1999: 84-96 - Balázs Imreh, Masami Ito:
On Some Special Classes of Regular Languages. Jewels are Forever 1999: 25-34 - Tao Jiang, Ming Li, Paul M. B. Vitányi:
Some Examples of Average-case Analysis by the Imcompressibility Method. Jewels are Forever 1999: 250-261 - Juhani Karhumäki, Leonid P. Lisovik:
On the Equivalence of Finite Substitutions and Transducers. Jewels are Forever 1999: 97-108 - Lila Kari, Jarkko Kari, Laura F. Landweber:
Reversible Molecular Computation in Ciliates. Jewels are Forever 1999: 353-363 - Werner Kuich:
Full Abstract Families of Tree Series I. Jewels are Forever 1999: 145-156 - Michel Latteux, Yves Roos:
Synchronized Shuffle and Regular Languages. Jewels are Forever 1999: 35-44 - Vincenzo Manca, Carlos Martín-Vide, Gheorghe Paun:
Iterated GSM Mappings: A Collapsing Hierarchy. Jewels are Forever 1999: 182-193 - Solomon Marcus:
On the Length of Words. Jewels are Forever 1999: 194-203 - Alexandru Mateescu, George Daniel Mateescu:
Fair and Associative Infinite Trajectories. Jewels are Forever 1999: 327-338 - Robert McNaughton:
An Insertion into the Chomsky Hierarchy? Jewels are Forever 1999: 204-212 - Giovanna Melideo, Cesidia Pasquarelli, Stefano Varricchio:
Linear Automata, Rational Series and a Theorem of Fine and Wilf. Jewels are Forever 1999: 157-168 - Filippo Mignosi, Antonio Restivo, Marinella Sciortino:
Forbidden Factors in Finite and Infinite Words. Jewels are Forever 1999: 339-350 - Taishin Y. Nishida:
Word Length Controlled DT0L Systems and Slender Languages. Jewels are Forever 1999: 213-221 - Zdzislaw Pawlak:
Logic, Probability, and Rough Sets. Jewels are Forever 1999: 364-373 - Wojciech Plandowski, Wojciech Rytter:
Complexity of Language Recognition Problems for Compressed Words. Jewels are Forever 1999: 262-272 - Kai Salomaa, Sheng Yu:
Synchronization Expressions: Characterization Results and Implementation. Jewels are Forever 1999: 45-56
skipping 3 more matches
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-07-26 14:25 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