![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
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 41 matches
- 2009
- Jorge Almeida
, Benjamin Steinberg
:
Matrix Mortality and the Cerný-Pin Conjecture. Developments in Language Theory 2009: 67-80 - Marie-Pierre Béal, Dominique Perrin:
A Quadratic Upper Bound on the Size of a Synchronizing Word in One-Cluster Automata. Developments in Language Theory 2009: 81-90 - Christoph Behle, Andreas Krebs, Stephanie Reifferscheid:
Regular Languages Definable by Majority Quantifiers with Two Variables. Developments in Language Theory 2009: 91-102 - Alberto Bertoni, Christian Choffrut, Roberto Radicioni:
The Inclusion Problem of Context-Free Languages: Some Tractable Cases. Developments in Language Theory 2009: 103-112 - Brandon Blakeley, Francine Blanchet-Sadri, Josh Gunter, Narad Rampersad:
On the Complexity of Deciding Avoidability of Sets of Partial Words. Developments in Language Theory 2009: 113-124 - Mikolaj Bojanczyk:
Factorization Forests. Developments in Language Theory 2009: 1-17 - Benedikt Bollig, Paul Gastin:
Weighted versus Probabilistic Logics. Developments in Language Theory 2009: 18-38 - Janusz A. Brzozowski, Elyot Grant, Jeffrey O. Shallit:
Closures in Formal Languages and Kuratowski's Theorem. Developments in Language Theory 2009: 125-144 - Michelangelo Bucci, Aldo de Luca, Alessandro De Luca
:
Rich and Periodic-Like Words. Developments in Language Theory 2009: 145-155 - Simone Campanoni, Stefano Crespi-Reghizzi:
Traces of Control-Flow Graphs. Developments in Language Theory 2009: 156-169 - Olivier Carton
:
Left and Right Synchronous Relations. Developments in Language Theory 2009: 170-182 - Elena Czeizler, Eugen Czeizler, Lila Kari, Shinnosuke Seki:
An Extension of the Lyndon Schützenberger Result to Pseudoperiodic Words. Developments in Language Theory 2009: 183-194 - Bruno Durand, Victor Poupet:
Asymptotic Cellular Complexity. Developments in Language Theory 2009: 195-206 - Ömer Egecioglu:
Strongly Regular Grammars and Regular Approximation of Context-Free Languages. Developments in Language Theory 2009: 207-220 - Szilárd Zsolt Fazekas
:
Powers of Regular Languages. Developments in Language Theory 2009: 221-227 - Dominik D. Freydenberger
, Daniel Reidenbach:
Existence and Nonexistence of Descriptive Patterns. Developments in Language Theory 2009: 228-239 - Pierluigi Frisco, Oscar H. Ibarra:
On Stateless Multihead Finite Automata and Multihead Pushdown Automata. Developments in Language Theory 2009: 240-251 - Christiane Frougny, Anna Chiara Lai
:
On Negative Bases. Developments in Language Theory 2009: 252-263 - Amy Glen, Bjarni V. Halldórsson
, Sergey Kitaev
:
Crucial Words for Abelian Powers. Developments in Language Theory 2009: 264-275 - Hermann Gruber
, Markus Holzer
:
Tight Bounds on the Descriptional Complexity of Regular Expressions. Developments in Language Theory 2009: 276-287 - Tero Harju
:
Post Correspondence Problem and Small Dimensional Matrices. Developments in Language Theory 2009: 39-46 - Emmanuel Jeandel, Guillaume Theyssier:
Subshifts, Languages and Logic. Developments in Language Theory 2009: 288-299 - Galina Jirásková
:
Magic Numbers and Ternary Alphabet. Developments in Language Theory 2009: 300-311 - Makoto Kanazawa:
The Pumping Lemma for Well-Nested Multiple Context-Free Languages. Developments in Language Theory 2009: 312-325 - Christos A. Kapoutsis
:
Size Complexity of Two-Way Finite Automata. Developments in Language Theory 2009: 47-66 - Daniel Kirsten:
The Support of a Recognizable Series over a Zero-Sum Free, Commutative Semiring Is Recognizable. Developments in Language Theory 2009: 326-333 - Vassilis Kountouriotis, Christos Nomikos, Panos Rondogiannis:
A Game-Theoretic Characterization of Boolean Grammars. Developments in Language Theory 2009: 334-347 - Oleg V. Kudinov
, Victor L. Selivanov:
Definability in the Infix Order on Words. Developments in Language Theory 2009: 454-465 - Markku Laine, Wojciech Plandowski:
Word Equations with One Unknown. Developments in Language Theory 2009: 348-359 - Tommi Lehtinen, Alexander Okhotin
:
On Equations over Sets of Numbers and Their Limitations. Developments in Language Theory 2009: 360-371
skipping 11 more matches
loading more results
failed to load more results, please try again later
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
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-26 13:41 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