Остановите войну!
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 21 matches
- 2018
- Simon Beier, Markus Holzer:
Properties of Right One-Way Jumping Finite Automata. DCFS 2018: 11-23 - Tara Brough:
Word Problem Languages for Free Inverse Monoids. DCFS 2018: 24-36 - Janusz A. Brzozowski, Sylvie Davies:
Most Complex Deterministic Union-Free Regular Languages. DCFS 2018: 37-48 - Da-Jung Cho, Yo-Sub Han, Kai Salomaa, Taylor J. Smith:
Site-Directed Insertion: Decision Problems, Maximality and Minimality. DCFS 2018: 49-61 - Louis-Marie Dando, Sylvain Lombardy:
Two-Way Automata over Locally Finite Semirings. DCFS 2018: 62-74 - Sylvie Davies:
A New Technique for Reachability of States in Concatenation Automata. DCFS 2018: 75-87 - Miguel Ferreira, Nelma Moreira, Rogério Reis:
Forward Injective Finite Automata: Exact and Random Generation of Nonisomorphic NFAs. DCFS 2018: 88-100 - Enrico Formenti, Paolo Massazza:
On the Generation of 2-Polyominoes. DCFS 2018: 101-113 - Massimiliano Goldwurm, Jianyi Lin, Marco Vignati:
A Local Limit Property for Pattern Statistics in Bicomponent Stochastic Models. DCFS 2018: 114-125 - Bruno Guillon, Luca Prigioniero:
Linear-Time Limited Automata. DCFS 2018: 126-138 - Stefan Hetzl, Simon Wolfsteiner:
Cover Complexity of Finite Languages. DCFS 2018: 139-150 - Markus Holzer, Simon Wolfsteiner:
On the Grammatical Complexity of Finite Languages. DCFS 2018: 151-162 - Oscar H. Ibarra, Ian McQuillan:
State Grammars with Stores. DCFS 2018: 163-174 - Rishat Ibrahimov, Kamil Khadiev, Krisjanis Prusis, Abuzer Yakaryilmaz:
Error-Free Affine, Unitary, and Probabilistic OBDDs. DCFS 2018: 175-187 - Galina Jirásková, Alexander Okhotin:
State Complexity of Unambiguous Operations on Deterministic Finite Automata. DCFS 2018: 188-199 - Chris Keeler, Kai Salomaa:
Cycle Height of Finite Automata. DCFS 2018: 200-211 - Martin Kutrib, Andreas Malcher, Christian Schneider:
Finite Automata with Undirected State Graphs. DCFS 2018: 212-223 - Alexander Okhotin, Kai Salomaa:
Further Closure Properties of Input-Driven Pushdown Automata. DCFS 2018: 224-236 - Ludwig Staiger:
Finite Automata and Randomness. DCFS 2018: 1-10 - Tomoyuki Yamakami:
State Complexity Characterizations of Parameterized Degree-Bounded Graph Connectivity, Sub-Linear Space Computation, and the Linear Space Hypothesis. DCFS 2018: 237-249 - Stavros Konstantinidis, Giovanni Pighizzini:
Descriptional Complexity of Formal Systems - 20th IFIP WG 1.02 International Conference, DCFS 2018, Halifax, NS, Canada, July 25-27, 2018, Proceedings. Lecture Notes in Computer Science 10952, Springer 2018, ISBN 978-3-319-94630-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-06-02 18:01 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