Остановите войну!
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 22 matches
- 2010
- Bo Cui, Yuan Gao, Lila Kari, Sheng Yu:
State Complexity of Catenation Combined with Star and Reversal. DCFS 2010: 58-67 - Jürgen Dassow, Florin Manea:
Accepting Hybrid Networks of Evolutionary Processors with Special Topologies and Small Communication. DCFS 2010: 68-77 - Zoltán Ésik:
Representing Small Ordinals by Finite Automata. DCFS 2010: 78-87 - Rudolf Freund, Marian Kogler, Yurii Rogozhin, Sergey Verlan:
Graph-Controlled Insertion-Deletion Systems. DCFS 2010: 88-98 - Yuan Gao, Kai Salomaa, Sheng Yu:
Transition Complexity of Incomplete DFAs. DCFS 2010: 99-109 - Markus Holzer, Sebastian Jakobi, Martin Kutrib:
The Magic Number Problem for Subregular Language Families. DCFS 2010: 110-119 - Lila Kari, Afroza Rahman:
Ciliate Gene Unscrambling with Fewer Templates. DCFS 2010: 120-129 - Ondrej Klíma, Libor Polák:
Descriptional Complexity of the Languages KaL: Automata, Monoids and Varieties. DCFS 2010: 130-138 - Nelma Moreira, Davide Nabais, Rogério Reis:
State Elimination Ordering Strategies: Some Experimental Results. DCFS 2010: 139-148 - Xiaoxue Piao, Kai Salomaa:
Operational State Complexity of Deterministic Unranked Tree Automata. DCFS 2010: 149-158 - Xiaoxue Piao, Kai Salomaa:
Transformations Between Different Types of Unranked Bottom-Up Tree Automata. DCFS 2010: 159-168 - Ronny Polley, Ludwig Staiger:
The Maximal Subword Complexity of Quasiperiodic Infinite Words. DCFS 2010: 169-176 - Bianca Truthe:
On the Descriptional Complexity of Limited Propagating Lindenmayer Systems. DCFS 2010: 177-188 - Yo-Sub Han, Kai Salomaa:
Nondeterministic State Complexity for Suffix-Free Regular Languages. DCFS 2010: 189-196 - Galina Jirásková, Monika Krausová:
Complexity in Prefix-Free Regular Languages. DCFS 2010: 197-204 - Anna Kasprzik:
Learning Residual Finite-State Automata Using Observation Tables. DCFS 2010: 205-212 - Przemyslaw Prusinkiewicz, Mitra Shirmohammadi, Faramarz Samavati:
L-systems in Geometric Modeling. DCFS 2010: 3-14 - Martin Kappes, Andreas Malcher, Detlef Wotschke:
Remembering Chandra Kintala. DCFS 2010: 15-26 - Janusz A. Brzozowski, Baiyu Li, Yuli Ye:
On the Complexity of the Evaluation of Transient Extensions of Boolean Functions. DCFS 2010: 27-37 - Cristian Calude, Kai Salomaa, Tania Roblot:
Finite-State Complexity and the Size of Transducers. DCFS 2010: 38-47 - Emilie Charlier, Narad Rampersad, Michel Rigo, Laurent Waxweiler:
State Complexity of Testing Divisibility. DCFS 2010: 48-57 - Ian McQuillan, Giovanni Pighizzini:
Proceedings Twelfth Annual Workshop on Descriptional Complexity of Formal Systems, DCFS 2010, Saskatoon, Canada, 8-10th August 2010. EPTCS 31, 2010 [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-11 16:32 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