![](https://dblp.uni-trier.de./img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de./img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de./img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de./img/search.dark.16x16.png)
![search dblp](https://dblp.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 16 matches
- 2022
- Duncan Adamson
:
Ranking Binary Unlabelled Necklaces in Polynomial Time. DCFS 2022: 15-29 - Stefano Crespi-Reghizzi:
The Alphabetic Complexity in Homomorphic Definitions of Word, Tree and Picture Languages. DCFS 2022: 1-14 - Jérôme Durand-Lose:
On the Power of Recursive Word-Functions Without Concatenation. DCFS 2022: 30-42 - Szilárd Zsolt Fazekas, Robert Mercas:
Clusters of Repetition Roots Forming Prefix Chains. DCFS 2022: 43-56 - Pamela Fleischmann, Lukas Haschke, Annika Huch, Annika Mayrock, Dirk Nowotka:
Nearly k-Universal Words - Investigating a Part of Simon's Congruence. DCFS 2022: 57-71 - Viliam Geffert, Dominika Palisínová, Alexander Szabari:
State Complexity of Binary Coded Regular Languages. DCFS 2022: 72-84 - Stefan Hoffmann
:
Reset Complexity and Completely Reachable Automata with Simple Idempotents. DCFS 2022: 85-99 - Markus Holzer
, Christian Rauch:
On the Descriptional Complexity of the Direct Product of Finite Automata. DCFS 2022: 100-111 - Michal Hospodár
, Peter Mlynárcik, Viktor Olejár
:
Operations on Subregular Languages and Nondeterministic State Complexity. DCFS 2022: 112-126 - Sungmin Kim, Yo-Sub Han, Sang-Ki Ko, Kai Salomaa:
On Simon's Congruence Closure of a String. DCFS 2022: 127-141 - Stavros Konstantinidis, Mitja Mastnak, Nelma Moreira
, Rogério Reis
:
Approximate NFA Universality Motivated by Information Theory. DCFS 2022: 142-154 - Orna Kupferman, Asaf Petruschka:
Lazy Regular Sensing. DCFS 2022: 155-169 - Martin Kutrib
, Matthias Wendlandt:
State Complexity of Finite Partial Languages. DCFS 2022: 170-183 - Hendrik Maarand
, Hellis Tamm
:
Yet Another Canonical Nondeterministic Automaton. DCFS 2022: 184-196 - Benedek Nagy:
Union-Complexities of Kleene Plus Operation. DCFS 2022: 197-211 - Yo-Sub Han
, György Vaszil
:
Descriptional Complexity of Formal Systems - 24th IFIP WG 1.02 International Conference, DCFS 2022, Debrecen, Hungary, August 29-31, 2022, Proceedings. Lecture Notes in Computer Science 13439, Springer 2022, ISBN 978-3-031-13256-8 [contents]
loading more results
failed to load more results, please try again later
![](https://dblp.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-09-11 04:12 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