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 25 matches
- 2017
- Markus Holzer, Martin Kutrib:
One-Time Nondeterministic Computations. DCFS 2017: 177-188 - Timothy Ng, David Rappaport, Kai Salomaa:
State Complexity of Suffix Distance. DCFS 2017: 287-298 - Shaull Almagor, Denis Kuperberg, Orna Kupferman:
Sensing as a Complexity Measure. DCFS 2017: 3-15 - Marcella Anselmo, Dora Giammarresi, Maria Madonia:
Avoiding Overlaps in Pictures. DCFS 2017: 16-32 - Suna Bensch, Maia Hoeberechts:
On the Degree of Nondeterminism of Tree Adjoining Languages and Head Grammar Languages. DCFS 2017: 65-76 - Sabine Broda, António Machiavelo, Nelma Moreira, Rogério Reis:
On the Average Complexity of Strong Star Normal Form. DCFS 2017: 77-88 - Janusz A. Brzozowski, Sylvie Davies:
Most Complex Non-returning Regular Languages. DCFS 2017: 89-101 - Jürgen Dassow:
Descriptional Complexity and Operations - Two Non-classical Cases. DCFS 2017: 33-44 - Maksims Dimitrijevs, Abuzer Yakaryilmaz:
Uncountable Realtime Probabilistic Classes. DCFS 2017: 102-113 - Rachel Faran, Orna Kupferman:
A Parametrized Analysis of Algorithms on Hierarchical Graphs. DCFS 2017: 114-127 - Henning Fernau, Lakshmanan Kuppusamy, Indhumathi Raman:
Graph-Controlled Insertion-Deletion Systems Generating Language Classes Beyond Linearity. DCFS 2017: 128-139 - Rudolf Freund, Vladimir Rogojin, Sergey Verlan:
Computational Completeness of Networks of Evolutionary Processors with Elementary Polarizations and a Small Number of Processors. DCFS 2017: 140-151 - Kitti Gelle, Szabolcs Iván:
Recognizing Union-Find Trees Built Up Using Union-By-Rank Strategy is NP-Complete. DCFS 2017: 152-163 - Yo-Sub Han, Hwee Kim, Trent A. Rogers, Shinnosuke Seki:
Self-attraction Removal from Oritatami Systems. DCFS 2017: 164-176 - Jozef Jirásek Jr., Matús Palmovský, Juraj Sebej:
Kuratowski Algebras Generated by Factor-, Subword-, and Suffix-Free Languages. DCFS 2017: 189-201 - Chris Keeler, Kai Salomaa:
Branching Measures and Nearly Acyclic NFAs. DCFS 2017: 202-213 - Stavros Konstantinidis:
Applications of Transducers in Independent Languages, Word Distances, Codes. DCFS 2017: 45-62 - Ivana Krajnáková, Galina Jirásková:
Square on Deterministic, Alternating, and Boolean Finite Automata. DCFS 2017: 214-225 - Kent Kwee, Friedrich Otto:
A Pumping Lemma for Ordered Restarting Automata. DCFS 2017: 226-237 - Giovanna J. Lavado, Luca Prigioniero:
Concise Representations of Reversible Automata. DCFS 2017: 238-249 - Laurette Marais, Lynette van Zijl:
State Complexity of Unary SV-XNFA with Different Acceptance Conditions. DCFS 2017: 250-261 - Marina I. Maslennikova:
Reset Complexity of Ideal Languages Over a Binary Alphabet. DCFS 2017: 262-273 - Turlough Neary:
2-State 2-Symbol Turing Machines with Periodic Support Produce Regular Sets. DCFS 2017: 274-286 - Alexander Okhotin, Kai Salomaa:
The Quotient Operation on Input-Driven Pushdown Automata. DCFS 2017: 299-310 - Giovanni Pighizzini, Cezar Câmpeanu:
Descriptional Complexity of Formal Systems - 19th IFIP WG 1.02 International Conference, DCFS 2017, Milano, Italy, July 3-5, 2017, Proceedings. Lecture Notes in Computer Science 10316, Springer 2017, ISBN 978-3-319-60251-6 [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-09-20 23: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