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 22 matches
- 2008
- Artiom Alhazov, Erzsébet Csuhaj-Varjú, Carlos Martín-Vide, Yurii Rogozhin:
Computational Completeness of Hybrid Networks of Evolutionary Processors with Seven Nodes. DCFS 2008: 38-47 - Eric Allender:
Circuit Complexity, Kolmogorov Complexity, and Prospects for Lower Bounds. DCFS 2008: 7-13 - Marco Almeida, Nelma Moreira, Rogério Reis:
Exact Generation of Acyclic Deterministic Finite Automata. DCFS 2008: 48-60 - Maria Paola Bianchi, Beatrice Palano:
On leftmost #-Rewriting Systems. DCFS 2008: 61-72 - Franziska Biegler, Kai Salomaa:
On the Synchronized Derivation Depth of Context-Free Grammars. DCFS 2008: 73-84 - Henning Bordihn, Markus Holzer, Martin Kutrib:
State Complexity of NFA to DFA Conversion of Subregular Language Families. DCFS 2008: 85-96 - Janusz A. Brzozowski, Stavros Konstantinidis:
State-Complexity Hierarchies of Uniform Languages of Alphabet-Size Length. DCFS 2008: 97-108 - Janusz A. Brzozowski, Nicolae Santean:
Determinism without Determinization. DCFS 2008: 109-120 - Cristian Calude:
Incompleteness: A Personal Perspective. DCFS 2008: 14-24 - Elena Czeizler, Eugen Czeizler, Lila Kari, Kai Salomaa:
Watson-Crick automata: determinism and state complexity. DCFS 2008: 121-133 - Mark Daley, Michael Domaratzki, Kai Salomaa:
State Complexity of Orthogonal Catenation. DCFS 2008: 134-144 - Jürgen Dassow, Bianca Truthe:
On Two Hierarchies of Subregularly Tree Controlled Languages. DCFS 2008: 145-156 - Takashi Emori, Taishin Y. Nishida:
An Efficient Derivation Method for DTOL Systems and a Measure of Derivation Complexity. DCFS 2008: 157-167 - Zoltán Ésik, Yuan Gao, Guangwu Liu, Sheng Yu:
Estimation of State Complexity of Combined Operations. DCFS 2008: 168-181 - András Faragó:
On the Descriptional Complexity of Path Optimization in Graphs. DCFS 2008: 207-215 - Hermann Gruber, Markus Holzer:
Language Operations with Regular Expressions of Polynomial Size. DCFS 2008: 182-193 - Lakshmanan Kuppusamy, Anand Mahendran, Kamala Krithivasan:
On the Trade-Off Between Ambiguity and Measures in Internal Contextual Grammars. DCFS 2008: 216-223 - Akihiro Matsuura, Yusuke Saito:
Equivalent Transformation of Minimal Finite Automata over a Two-Letter Alphabet. DCFS 2008: 224-232 - Xiaoxue Piao, Kai Salomaa:
Operational State Complexity of Nested Word Automata. DCFS 2008: 194-206 - Balasubramanian Ravikumar:
Non-regularity, Approximation and State Complexity. DCFS 2008: 25 - György Vaszil:
Automata-like Membrane Systems - A Natural Way to Describe Complex Phenomena. DCFS 2008: 26-37 - Cezar Câmpeanu, Giovanni Pighizzini:
10th International Workshop on Descriptional Complexity of Formal Systems, DCFS 2008, Charlottetown, Prince Edward Island, Canada, July 16-18, 2008. University of Prince Edward Island 2008, ISBN 978-0-919013-56-8 [contents]
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-10-06 09:58 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