Остановите войну!
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 45 matches
- 2010
- Suna Bensch, Henrik Björklund, Frank Drewes:
Algorithmic Properties of Millstream Systems. Developments in Language Theory 2010: 54-65 - Mikhail V. Berlinkov:
On a Conjecture by Carpi and D'Alessandro. Developments in Language Theory 2010: 66-75 - Mouhebeddine Berrima, Narjes Ben Rajeb:
Linking Algebraic Observational Equivalence and Bisimulation. Developments in Language Theory 2010: 76-87 - Henning Bordihn, Martin Kutrib, Andreas Malcher:
Undecidability and Hierarchy Results for Parallel Communicating Finite Automata. Developments in Language Theory 2010: 88-99 - Joachim Bremer, Dominik D. Freydenberger:
Inclusion Problems for Patterns with a Bounded Number of Variables. Developments in Language Theory 2010: 100-111 - Sabine Broda, António Machiavelo, Nelma Moreira, Rogério Reis:
On the Average Number of States of Partial Derivative Automata. Developments in Language Theory 2010: 112-123 - Arturo Carpi, Flavio D'Alessandro:
On the Hybrid Cerný-Road Coloring Problem and Hamiltonian Paths. Developments in Language Theory 2010: 124-135 - Pierre Chambart, Philippe Schnoebelen:
Computing Blocker Sets for the Regular Post Embedding Problem. Developments in Language Theory 2010: 136-147 - Ehsan Chiniforooshan, Lila Kari, Zhi Xu:
Pseudo-power Avoidance. Developments in Language Theory 2010: 432-433 - Luc Dartois, Manfred Kufleitner, Alexander Lauser:
Rankers over Infinite Words - (Extended Abstract). Developments in Language Theory 2010: 148-159 - Jürgen Dassow, Tomás Masopust:
On Restricted Context-Free Grammars. Developments in Language Theory 2010: 434-435 - Manfred Droste, Heiko Vogler:
Kleene and Büchi Theorems for Weighted Automata and Multi-valued Logics over Arbitrary Bounded Lattices. Developments in Language Theory 2010: 160-172 - Andrzej Ehrenfeucht, Grzegorz Rozenberg:
Reaction Systems: A Model of Computation Inspired by Biochemistry. Developments in Language Theory 2010: 1-3 - Zoltán Ésik, Szabolcs Iván:
On Müller Context-Free Grammars. Developments in Language Theory 2010: 173-184 - Sylvia Friese, Helmut Seidl, Sebastian Maneth:
Minimization of Deterministic Bottom-Up Tree Transducers. Developments in Language Theory 2010: 185-196 - Viliam Geffert, Giovanni Pighizzini:
Two-Way Unary Automata versus Logarithmic Space. Developments in Language Theory 2010: 197-208 - Dora Giammarresi:
A Brief Excursion Inside the Class of Tiling Recognizable Two-Dimensional Languages. Developments in Language Theory 2010: 4-15 - Vesa Halava, Tero Harju, Tomi Kärki, Michel Rigo:
On the Periodicity of Morphic Words. Developments in Language Theory 2010: 209-217 - Magnús M. Halldórsson, Sergey Kitaev, Artem V. Pyatkin:
Graphs Capturing Alternations in Words. Developments in Language Theory 2010: 436-437 - Niko Haubold, Markus Lohrey, Christian Mathissen:
Compressed Conjugacy and the Word Problem for Outer Automorphism Groups of Graph Groups. Developments in Language Theory 2010: 218-230 - Tom Head:
Using Light to Implement Parallel Boolean Algebra. Developments in Language Theory 2010: 231-242 - Markus Holzer, Martin Kutrib:
The Complexity of Regular(-Like) Expressions. Developments in Language Theory 2010: 16-30 - Oscar H. Ibarra:
On Decision Problems for Simple and Parameterized Machines. Developments in Language Theory 2010: 31 - Emmanuel Jeandel, Pascal Vanier:
Periodicity in Tilings. Developments in Language Theory 2010: 243-254 - Galina Jirásková, Tomás Masopust:
Complexity in Union-Free Regular Languages. Developments in Language Theory 2010: 255-266 - Lila Kari:
DNA Computing and Its Implications for Theoretical Computer Science. Developments in Language Theory 2010: 32 - Lila Kari, Shinnosuke Seki:
Schema for Parallel Insertion and Deletion. Developments in Language Theory 2010: 267-278 - Ondrej Klíma, Libor Polák:
On Schützenberger Products of Semirings. Developments in Language Theory 2010: 279-290 - Steffen Kopecki:
On the Iterated Hairpin Completion. Developments in Language Theory 2010: 438-439 - Tommi Lehtinen, Alexander Okhotin:
On Language Equations XXK = XXL and XM = N over a Unary Alphabet. Developments in Language Theory 2010: 291-302
skipping 15 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-18 08: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