Остановите войну!
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 51 matches
- 2007
- Farid M. Ablayev, Aida Gainutdinova:
Classical Simulation Complexity of Quantum Branching Programs. LATA 2007: 49-56 - Artiom Alhazov, Carlos Martín-Vide, Yurii Rogozhin:
Networks of Evolutionary Processors with Two Nodes Are Unpredictable. LATA 2007: 521-528 - Pavlos Antoniou, Maxime Crochemore, Costas S. Iliopoulos, Pierre Peterlongo:
Application of suffix trees for the acquisition of common motifs with gaps in a set of strings. LATA 2007: 57-66 - Franz Baader, Jan Hladik, Rafael Peñaloza:
SI! Automata Can Show PSPACE Results for Description Logics. LATA 2007: 67-78 - Pawel Baturo, Wojciech Rytter:
Occurrence and Lexicographic Properties of Standard Sturmian Words. LATA 2007: 79-90 - Suna Bensch:
An Approach to Parallel Mildly Context-Sensitive Grammar Formalisms. LATA 2007: 91-102 - Francine Blanchet-Sadri, Kevin Corcoran, Jenell Nyberg:
Fine and Wilf's Periodicity Result on Partial Words and Consequences. LATA 2007: 115-126 - Baptiste Blanpain, Jean-Marc Champarnaud, Jean-Philippe Dubernard:
Geometrical Languages. LATA 2007: 127-138 - Olivier Bodini, Thomas Fernique, Eric Rémila:
A Characterization of Flip-accessibility for Rhombus Tilings of the Whole Plane. LATA 2007: 139-150 - Paolo Boldi, Violetta Lonati, Roberto Radicioni, Massimo Santini:
The Number of Convex Permutominoes. LATA 2007: 151-162 - Benedikt Bollig, Dietrich Kuske:
Muller Message-Passing Automata and Logics. LATA 2007: 163-174 - Bernd Borchert, Klaus Reinhardt:
Deterministically and Sudoku-Deterministically Recognizable Picture Languages. LATA 2007: 175-186 - Henning Bordihn, György Vaszil:
On leftmost derivations in CD grammar systems. LATA 2007: 187-198 - Julien Bourdaillet, Jean-Gabriel Ganascia:
Practical block sequence alignment with moves. LATA 2007: 199-210 - Vinay Choudhary, Anand Kumar Sinha, Somenath Biswas:
Universality for Nondeterministic Logspace. LATA 2007: 103-114 - Jürgen Dassow, Henning Fernau:
Comparison of Some Descriptional Complexities of 0L Systems Obtained by a Unifying Approach. LATA 2007: 249-260 - Volker Diekert:
Equations: From Words to Graph Products. LATA 2007: 1-6 - Liviu Petrisor Dinu, Radu Gramatovici, Florin Manea:
On the syllabification of words via go-through automata. LATA 2007: 223-236 - Pál Dömösi:
Automata Networks without any Letichevsky Criteria. LATA 2007: 237-248 - Nissim Francez, Michael Kaminski:
Pushdown automata with cancellation and commutation-augmented pregroups grammars. LATA 2007: 7-26 - Hermann Gruber, Markus Holzer:
Computational Complexity of NFA Minimization for Finite and Unary Languages. LATA 2007: 261-272 - Yo-Sub Han, Derick Wood:
Generalizations of One-Deterministic Regular Languages. LATA 2007: 273-284 - Costas S. Iliopoulos, Inuka Jayasekera, Borivoj Melichar, Jan Supol:
Weighted Degenerated Approximate Pattern Matching. LATA 2007: 285-296 - Helmut Jürgensen:
Synchronization. LATA 2007: 27-48 - Martin Kochol, Nad'a Krivonáková, Silvia Smejová, Katarína Sranková:
Reductions of matrices associated with nowhere-zero flows. LATA 2007: 297-306 - Ekaterina Komendantskaya:
First-order deduction in neural networks. LATA 2007: 307-318 - Miklós Krész:
Nondeterministic soliton automata with a single external vertex. LATA 2007: 319-330 - Martin Kutrib, Andreas Malcher:
Fast Reversible Language Recognition Using Cellular Automata. LATA 2007: 331-342 - Martin Kutrib, Jens Reimann:
Succinct Description of Regular Languages by Weak Restarting Automata. LATA 2007: 343-354 - Pietro di Lena, Luciano Margara:
Computational Complexity of Dynamical Systems: the case of Cellular Automata. LATA 2007: 211-222
skipping 21 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-06-05 09:36 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