Остановите войну!
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
- 2005
- Marcella Anselmo, Maria Madonia:
A Language-Theoretic Approach to Covering Problems. J. Autom. Lang. Comb. 10(1): 3-24 (2005) - Magdi H. Armanious:
Cubic and Semi-Cubic SQS-Skeins. J. Autom. Lang. Comb. 10(1): 25-35 (2005) - Behshad Behzadi, Jean-Marc Steyaert:
The Transformation Distance Problem Revisited. J. Autom. Lang. Comb. 10(5/6): 577-587 (2005) - Björn Borchardt, Zoltán Fülöp, Zsolt Gazdag, Andreas Maletti:
Bounds for Tree Automata with Polynomial Costs. J. Autom. Lang. Comb. 10(2/3): 107-157 (2005) - Patricia Bouyer, Fabrice Chevalier:
On Conciseness of Extensions of Timed Automata. J. Autom. Lang. Comb. 10(4): 393-405 (2005) - Symeon Bozapalidis:
On the Closure of Recognizable Tree Series Under Tree Homomorphisms. J. Autom. Lang. Comb. 10(2/3): 185-202 (2005) - Symeon Bozapalidis, Archontia Grammatikopoulou:
Recognizable Picture Series. J. Autom. Lang. Comb. 10(2/3): 159-183 (2005) - Domenico Cantone, Simone Faro:
Fast-Search Algorithms: New Efficient Variants of the Boyer-Moore Pattern-Matching Algorithm. J. Autom. Lang. Comb. 10(5/6): 589-608 (2005) - Manolis Christodoulakis, Costas S. Iliopoulos, Kunsoo Park, Jeong Seop Sim:
Approximate Seeds of Strings. J. Autom. Lang. Comb. 10(5/6): 609-626 (2005) - Loek G. Cleophas, Gerard Zwaan, Bruce W. Watson:
Constructing Factor Oracles. J. Autom. Lang. Comb. 10(5/6): 627-640 (2005) - Richard Cole, Costas S. Iliopoulos, Manal Mohamed, William F. Smyth, Lu Yang:
The Complexity of the Minimum k-Cover Problem. J. Autom. Lang. Comb. 10(5/6): 641-653 (2005) - Jurek Czyzowicz, Wojciech Fraczak, Andrzej Pelc:
Transducers with Set Output. J. Autom. Lang. Comb. 10(1): 37-49 (2005) - Manfred Droste, Heiko Vogler:
Editorial. J. Autom. Lang. Comb. 10(2/3): 105 (2005) - Jean-Pierre Duval, Thierry Lecroq, Arnaud Lefebvre:
Border Array on Bounded Alphabet. J. Autom. Lang. Comb. 10(1): 51-60 (2005) - Keith Ellul, Bryan Krawetz, Jeffrey O. Shallit, Ming-wei Wang:
Regular Expressions: New Results and Open Problems. J. Autom. Lang. Comb. 10(4): 407-437 (2005) - Zoltán Ésik, Werner Kuich:
A Semiring-Semimodule Generalization of ω-Regular Languages I. J. Autom. Lang. Comb. 10(2/3): 203-242 (2005) - Zoltán Ésik, Werner Kuich:
A Semiring-Semimodule Generalization of ω-Regular Languages II. J. Autom. Lang. Comb. 10(2/3): 243-264 (2005) - Abolfazl Fatholahzadeh:
Learning the Morphological Features of a Large Set of Words. J. Autom. Lang. Comb. 10(5/6): 655-669 (2005) - Olivier Finkel:
On the Length of the Wadge Hierarchy of ω-Context Free Languages. J. Autom. Lang. Comb. 10(4): 439-464 (2005) - Christiane Frougny, Laurent Vuillon:
Coding of Two-Dimensional Constraints of Finite Type by Substitutions. J. Autom. Lang. Comb. 10(4): 465-482 (2005) - Zsolt Gazdag:
Shape Preserving Bottom-Up Tree Transducers. J. Autom. Lang. Comb. 10(4): 483-534 (2005) - Mathieu Giraud, Dominique Lavenier:
Dealing with Hardware Space Limits when Removing Epsilon-Transitions in a Genomic Weighted Finite Automaton. J. Autom. Lang. Comb. 10(2/3): 265-285 (2005) - Richard Groult, Martine Léonard, Laurent Mouchard:
A Linear Algorithm for the Detection of Evolutive Tandem Repeats. J. Autom. Lang. Comb. 10(5/6): 671-685 (2005) - Jan Holub:
Editorial. J. Autom. Lang. Comb. 10(5/6): 575 (2005) - Costas S. Iliopoulos, Laurent Mouchard, Katerina Perdikuri, Athanasios K. Tsakalidis:
Computing the Repetitions in a Biological Weighted Sequence. J. Autom. Lang. Comb. 10(5/6): 687-696 (2005) - Daniel Kirsten, Ina Mäurer:
On the Determinization of Weighted Automata. J. Autom. Lang. Comb. 10(2/3): 287-312 (2005) - Andreas Maletti, Heiko Vogler:
Incomparability Results for Classes of Polynomial Tree Series Transformations. J. Autom. Lang. Comb. 10(4): 535-568 (2005) - Ingmar Meinecke:
The Hadamard Product of Sequential-Parallel Series. J. Autom. Lang. Comb. 10(2/3): 313-346 (2005) - Tetsuya Nakatoh, Kensuke Baba, Daisuke Ikeda, Yasuhiro Yamada, Sachio Hirokawa:
An Efficient Mapping for Computing the Score of String Matching. J. Autom. Lang. Comb. 10(5/6): 697-704 (2005) - Taishin Y. Nishida:
Some New Aspects of Word-Length Controlled DT0L Systems. J. Autom. Lang. Comb. 10(1): 61-77 (2005)
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-04-25 19:00 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