![](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 26 matches
- 2011
- Levent Alpoge, Thomas Ang, Luke Schaeffer, Jeffrey O. Shallit:
Decidability and Shortest Strings in Formal Languages. DCFS 2011: 55-67 - Fernando Arroyo
, Juan Castellanos, Victor Mitrana:
On the Degree of Team Cooperation in CD Grammar Systems. DCFS 2011: 68-79 - Zuzana Bednárová, Viliam Geffert, Carlo Mereghetti
, Beatrice Palano
:
The Size-Cost of Boolean Operations on Constant Height Deterministic Pushdown Automata. DCFS 2011: 80-92 - Janusz A. Brzozowski, Baiyu Li, Yuli Ye:
Syntactic Complexity of Prefix-, Suffix-, and Bifix-Free Regular Languages. DCFS 2011: 93-106 - Jean-Marc Champarnaud, Jean-Philippe Dubernard, Franck Guingne, Hadrien Jeanne:
Geometrical Regular Languages and Linear Diophantine Equations. DCFS 2011: 107-120 - Erzsébet Csuhaj-Varjú, György Vaszil:
On the Number of Components and Clusters of Non-returning Parallel Communicating Grammar Systems. DCFS 2011: 121-134 - Jürgen Dassow, Florin Manea, Bianca Truthe
:
On Contextual Grammars with Subregular Selection Languages. DCFS 2011: 135-146 - Erik D. Demaine, Sarah Eisenstat, Jeffrey O. Shallit, David A. Wilson:
Remarks on Separating Words. DCFS 2011: 147-157 - Yuan Gao, Sheng Yu:
State Complexity of Four Combined Operations Composed of Union, Intersection, Star and Reversal. DCFS 2011: 158-171 - Radu Gramatovici, Florin Manea:
k-Local Internal Contextual Grammars. DCFS 2011: 172-183 - Oscar H. Ibarra, Nicholas Q. Trân:
On Synchronized Multitape and Multihead Automata. DCFS 2011: 184-197 - Galina Jirásková
, Tomás Masopust
:
State Complexity of Projected Languages. DCFS 2011: 198-211 - Galina Jirásková
, Juraj Sebej:
Note on Reversal of Binary Regular Languages. DCFS 2011: 212-221 - Jarkko Kari
:
Linear Algebra Based Bounds for One-Dimensional Cellular Automata. DCFS 2011: 1-7 - Shankara Narayanan Krishna, Gabriel Ciobanu
:
A S2P ÈP2P\Sigma_2P \cup \Pi_2P Lower Bound Using Mobile Membranes. DCFS 2011: 275-288 - Michal Kunc, Alexander Okhotin
:
State Complexity of Operations on Two-Way Deterministic Finite Automata over a Unary Alphabet. DCFS 2011: 222-234 - Kamal Lodaya, Madhavan Mukund, Ramchandra Phawade:
Kleene Theorems for Product Systems. DCFS 2011: 235-247 - Andreas Malcher
, Carlo Mereghetti
, Beatrice Palano
:
Descriptional Complexity of Two-Way Pushdown Automata with Restricted Head Reversals. DCFS 2011: 248-260 - Friedrich Otto:
On Restarting Automata with Window Size One. DCFS 2011: 8-33 - Xiaoxue Piao, Kai Salomaa:
State Trade-Offs in Unranked Tree Automata. DCFS 2011: 261-274 - Stefan Schwoon, César Rodríguez:
Construction and SAT-Based Verification of Contextual Unfoldings. DCFS 2011: 34-42 - Denis Thérien:
The Power of Diversity. DCFS 2011: 43-54 - Sherzod Turaev
, Jürgen Dassow, Mohd Hasan Selamat:
Language Classes Generated by Tree Controlled Grammars with Bounded Nonterminal Complexity. DCFS 2011: 289-300 - Maris Valdats:
Transition Function Complexity of Finite Automata. DCFS 2011: 301-313 - Jirí Wiedermann
:
Complexity of Nondeterministic Multitape Computations Based on Crossing Sequences. DCFS 2011: 314-327 - Markus Holzer, Martin Kutrib
, Giovanni Pighizzini:
Descriptional Complexity of Formal Systems - 13th International Workshop, DCFS 2011, Gießen/Limburg, Germany, July 25-27, 2011. Proceedings. Lecture Notes in Computer Science 6808, Springer 2011, ISBN 978-3-642-22599-4 [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-08-24 03:39 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