Остановите войну!
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 27 matches
- 2006
- Tanbir Ahmed, Gösta Grahne:
Parallel Composition of Finite State Activity Automata. DCFS 2006: 46-57 - Marco Almeida, Nelma Moreira, Rogério Reis:
Aspects of Enumeration and Generation with a String Automata Representation. DCFS 2006: 58-69 - Franziska Biegler, Michael J. Burrell, Mark Daley:
Regulated RNA rewriting: modelling RNA editing with guided insertion. DCFS 2006: 70-81 - Franziska Biegler, Ian McQuillan, Kai Salomaa:
An Infinite Hierarchy Induced by Depth Synchronization. DCFS 2006: 82-93 - Cezar Câmpeanu, Andrei Paun, Jason R. Smith:
Tight Bounds for the State Complexity of Deterministic Cover Automata. DCFS 2006: 223-231 - Haiming Chen, Mihai Ionescu, Andrei Paun, Gheorghe Paun, Bianca Popa:
On Trace Languages Generated by (Small) Spiking Neural P Systems. DCFS 2006: 94-105 - Alessandra Cherubini, Andrzej Kisielewicz:
Recognizing Collapsing Words is co-NP-Complete. DCFS 2006: 106-117 - Vinod Chirayath, Luc Longpré:
Measuring privacy loss in statistical databases. DCFS 2006: 16-25 - Brian Cloteaux, Desh Ranjan:
Some Separation Results Between Classes of Pointer Algorithms. DCFS 2006: 232-240 - Brendan J. Cordy, Kai Salomaa:
Regular Approximations of Non-Regular Languages. DCFS 2006: 118-129 - Jürgen Dassow, Bianca Truthe:
On the Degree Complexity of Special Non-Context-Free Languages with Respect to PC Grammar Systems. DCFS 2006: 241-249 - Jürgen Dassow, György Vaszil:
On the Number of Active Symbols in Lindenmayer Systems. DCFS 2006: 130-140 - Michael Domaratzki, Kai Salomaa:
Transition Complexity of Language Operations. DCFS 2006: 141-152 - Piotr Faliszewski, Lane A. Hemaspaandra:
The Consequences of Eliminating NP Solutions. DCFS 2006: 1-15 - Rudolf Freund:
Special Variants of P Systems with One Catalyst in One Membrane. DCFS 2006: 250-258 - Rudolf Freund, Marion Oswald:
A Small Universal Antiport P System with Forbidden Context. DCFS 2006: 259-266 - Yuan Gao, Kai Salomaa, Sheng Yu:
State Complexity of Catenation and Reversal Combined with Star. DCFS 2006: 153-164 - Hermann Gruber, Markus Holzer:
Results on the Average State and Transition Complexity of Finite Automata Accepting Finite Languages (Extended Abstract). DCFS 2006: 267-275 - Yo-Sub Han, Kai Salomaa, Derick Wood:
State Complexity of Prefix-Free Regular Languages. DCFS 2006: 165-176 - Markus Holzer, Martin Kutrib:
The Size of Higman-Haines Sets. DCFS 2006: 177-187 - J. Kavitha, L. Jeganathan, G. Sethuraman:
Descriptional Complexity of Alternating Finite Automata. DCFS 2006: 188-198 - Joachim Kupke:
A Powerful Tool in Lower-Bounding Constantly Ambiguous Automata. DCFS 2006: 276-284 - Andreas Malcher:
Cellular Automata and Descriptional Complexity. DCFS 2006: 26-40 - Carlo Mereghetti, Beatrice Palano:
Quantum Automata for some Multiperiodic Languages. DCFS 2006: 199-210 - Frank Nießner, Ulrich Ultes-Nitsche:
A Complete Characterization of Deterministic Regular Liveness Properties. DCFS 2006: 211-222 - Jeffrey O. Shallit:
New Directions in State Complexity. DCFS 2006: 41-45 - Hing Leung, Giovanni Pighizzini:
8th International Workshop on Descriptional Complexity of Formal Systems - DCFS 2006, Las Cruces, New Mexico, USA, June 21 - 23, 2006. Proceedings. New Mexico State University, Las Cruces, New Mexico, USA 2006 [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-07-28 20:58 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