![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.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 29 matches
- 2005
- Alberto Bertoni, Carlo Mereghetti, Beatrice Palano:
Some formal methods for analyzing quantum automata. DCFS 2005: 1-14 - Franziska Biegler:
Synchronization Functions of Synchronized Context-Free Grammars and Languages. DCFS 2005: 236-244 - Henning Bordihn, Henning Fernau:
The degree of parallelism. DCFS 2005: 51-62 - Henning Bordihn, Bettina Sunckel:
On active symbols in CD grammar systems. DCFS 2005: 63-74 - Egon Börger:
Using Abstract State Machines for the Description and the Analysis of Formal Systems. DCFS 2005: 15-22 - Cezar Câmpeanu, Nicolae Santean, Sheng Yu:
Large NFA Without Mergeable States. DCFS 2005: 75-84 - Michael Domaratzki, Alexander Okhotin, Jeffrey O. Shallit:
Enumeration of Context-Free Languages and Related Structures. DCFS 2005: 85-96 - Berke Durak:
Two-way non-deterministic finite automata with a write-once track recognize regular languages only. DCFS 2005: 97-109 - Henning Fernau, Rudolf Freund, Marion Oswald, Klaus Reinhardt:
Refining the Nonterminal Complexity of Graph-controlled Grammars. DCFS 2005: 110-121 - Viliam Geffert:
(Non)determinism and the Size of One-Way Finite Automata. DCFS 2005: 23-37 - Gregor Gramlich, Ralf Herrmann:
Learning Unary Automata. DCFS 2005: 122-133 - Miguel Angel Gutiérrez-Naranjo, Mario J. Pérez-Jiménez, Agustin Riscos-Núñez:
Multidimensional Descriptional Complexity of P Systems. DCFS 2005: 134-145 - Yo-Sub Han, Gerhard Trippen, Derick Wood:
Simple-Regular Expressions and Languages. DCFS 2005: 146-157 - Markus Holzer, Martin Kutrib, Jens Reimann:
Descriptional Complexity of Deterministic Restarting Automata. DCFS 2005: 158-169 - Marek Hricko, Galina Jirásková, Alexander Szabari:
Union and Intersection of Regular Languages and Descriptional Complexity. DCFS 2005: 170-181 - Juraj Hromkovic, Georg Schnitger:
Communication Complexity Method for Proving Lower Bounds on Descriptional Complexity in Automata and Formal Language Theory. DCFS 2005: 38-38 - Galina Jirásková, Alexander Okhotin:
State complexity of cyclic shift. DCFS 2005: 182-193 - Christos A. Kapoutsis:
Deterministic moles cannot solve liveness. DCFS 2005: 194-205 - Lila Kari, Petr Sosík:
On Weight of Universal Insertion Grammars. DCFS 2005: 206-214 - Miklós Krész:
On the descriptional complexity of soliton automata. DCFS 2005: 245-252 - Lakshmanan Kuppusamy:
Incompatible Measures of Internal Contextual Grammars. DCFS 2005: 253-260 - Andreas Malcher:
On Recursive and Non-Recursive Trade-Offs Between Finite-Turn Pushdown Automata. DCFS 2005: 215-226 - Libor Polák:
Remarks on Multiple Entry Deterministic Finite Automata. DCFS 2005: 261-268 - Rogério Reis, Nelma Moreira, Marco Almeida:
On the Representation of Finite Automata. DCFS 2005: 269-276 - Ludwig Staiger:
The Kolmogorov complexity of infinite objects. DCFS 2005: 39-50 - Bettina Sunckel:
A note on the descriptional complexity of CD grammar systems of finite index. DCFS 2005: 277-284 - György Vaszil:
Non-returning PC Grammar Systems Generate Any Recursively Enumerable Language with Eight Context-free Components. DCFS 2005: 227-235 - Sergey Verlan:
On minimal context-free insertion-deletion systems. DCFS 2005: 285-292 - Carlo Mereghetti, Beatrice Palano, Giovanni Pighizzini, Detlef Wotschke:
7th International Workshop on Descriptional Complexity of Formal Systems - DCFS 2005, Como, Italy, June 30 - July 2, 2005. Proceedings. Università degli Studi di Milano, Milan, Italy 2005 [contents]
loading more results
failed to load more results, please try again later
![](https://dblp1.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-06-30 13:16 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