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 23 matches
- 2019
- Petra Wolf:
On the Decidability of Finding a Positive ILP-Instance in a Regular Set of ILP-Instances. DCFS 2019: 272-284 - Simon Beier, Markus Holzer:
Nondeterministic Right One-Way Jumping Finite Automata (Extended Abstract). DCFS 2019: 74-85 - Janusz A. Brzozowski, Sylvie Davies, Abhishek Madan:
State Complexity of Single-Word Pattern Matching in Regular Languages. DCFS 2019: 86-97 - Sylvie Davies, Michal Hospodár:
Square, Power, Positive Closure, and Complementation on Star-Free Languages. DCFS 2019: 98-110 - Henning Fernau, Lakshmanan Kuppusamy, Indhumathi Raman:
Descriptional Complexity of Matrix Simple Semi-conditional Grammars. DCFS 2019: 111-123 - Henning Fernau, Martin Vu:
Regulated Tree Automata. DCFS 2019: 124-136 - Rudolf Freund:
A General Framework for Sequential Grammars with Control Mechanisms. DCFS 2019: 1-34 - Daniel Gabric, Stepan Holub, Jeffrey O. Shallit:
Generalized de Bruijn Words and the State Complexity of Conjugate Sets. DCFS 2019: 137-146 - Kitti Gelle, Szabolcs Iván:
The Syntactic Complexity of Semi-flower Languages. DCFS 2019: 147-157 - Yo-Sub Han, Sang-Ki Ko, Kai Salomaa:
Limited Nondeterminism of Input-Driven Pushdown Automata: Decidability and Complexity. DCFS 2019: 158-170 - Mathieu Hoyrup, Cristobal Rojas, Victor L. Selivanov, Donald M. Stull:
Computability on Quasi-Polish Spaces. DCFS 2019: 171-183 - Galina Jirásková, Ivana Krajnáková:
NFA-to-DFA Trade-Off for Regular Operations. DCFS 2019: 184-196 - Lila Kari, Timothy Ng:
State Complexity of Simple Splicing. DCFS 2019: 197-209 - Jarkko Kari:
Low-Complexity Tilings of the Plane. DCFS 2019: 35-45 - Chris Keeler, Kai Salomaa:
Nondeterminism Growth and State Complexity. DCFS 2019: 210-222 - Martin Kutrib, Andreas Malcher, Carlo Mereghetti, Beatrice Palano:
Descriptional Complexity of Iterated Uniform Finite-State Transducers. DCFS 2019: 223-234 - Benedek Nagy:
Union-Freeness, Deterministic Union-Freeness and Union-Complexity. DCFS 2019: 46-56 - Mizuhito Ogawa, Victor L. Selivanov:
On Classes of Regular Languages Related to Monotone WQOs. DCFS 2019: 235-247 - Alexander Okhotin, Elizaveta Sazhneva:
State Complexity of GF(2)-Concatenation and GF(2)-Inverse on Unary Languages. DCFS 2019: 248-259 - Giovanni Pighizzini:
Limited Automata: Properties, Complexity and Variants. DCFS 2019: 57-73 - Giovanni Pighizzini, Luca Prigioniero:
Pushdown Automata and Constant Height: Decidability and Bounds. DCFS 2019: 260-271 - Tomoyuki Yamakami:
How Does Adiabatic Quantum Computation Fit into Quantum Automata Theory? DCFS 2019: 285-297 - Michal Hospodár, Galina Jirásková, Stavros Konstantinidis:
Descriptional Complexity of Formal Systems - 21st IFIP WG 1.02 International Conference, DCFS 2019, Košice, Slovakia, July 17-19, 2019, Proceedings. Lecture Notes in Computer Science 11612, Springer 2019, ISBN 978-3-030-23246-7 [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-28 10:34 CET 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