Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID10. DCFS 2008: Charlottetown, PE, Canada
- Cezar Câmpeanu, Giovanni Pighizzini:
10th International Workshop on Descriptional Complexity of Formal Systems, DCFS 2008, Charlottetown, Prince Edward Island, Canada, July 16-18, 2008. University of Prince Edward Island 2008, ISBN 978-0-919013-56-8
Invited Papers
- Eric Allender:
Circuit Complexity, Kolmogorov Complexity, and Prospects for Lower Bounds. DCFS 2008: 7-13 - Cristian Calude:
Incompleteness: A Personal Perspective. DCFS 2008: 14-24 - Balasubramanian Ravikumar:
Non-regularity, Approximation and State Complexity. DCFS 2008: 25 - György Vaszil:
Automata-like Membrane Systems - A Natural Way to Describe Complex Phenomena. DCFS 2008: 26-37
Regular Contributions
- Artiom Alhazov, Erzsébet Csuhaj-Varjú, Carlos Martín-Vide, Yurii Rogozhin:
Computational Completeness of Hybrid Networks of Evolutionary Processors with Seven Nodes. DCFS 2008: 38-47 - Marco Almeida, Nelma Moreira, Rogério Reis:
Exact Generation of Acyclic Deterministic Finite Automata. DCFS 2008: 48-60 - Maria Paola Bianchi, Beatrice Palano:
On leftmost #-Rewriting Systems. DCFS 2008: 61-72 - Franziska Biegler, Kai Salomaa:
On the Synchronized Derivation Depth of Context-Free Grammars. DCFS 2008: 73-84 - Henning Bordihn, Markus Holzer, Martin Kutrib:
State Complexity of NFA to DFA Conversion of Subregular Language Families. DCFS 2008: 85-96 - Janusz A. Brzozowski, Stavros Konstantinidis:
State-Complexity Hierarchies of Uniform Languages of Alphabet-Size Length. DCFS 2008: 97-108 - Janusz A. Brzozowski, Nicolae Santean:
Determinism without Determinization. DCFS 2008: 109-120 - Elena Czeizler, Eugen Czeizler, Lila Kari, Kai Salomaa:
Watson-Crick automata: determinism and state complexity. DCFS 2008: 121-133 - Mark Daley, Michael Domaratzki, Kai Salomaa:
State Complexity of Orthogonal Catenation. DCFS 2008: 134-144 - Jürgen Dassow, Bianca Truthe:
On Two Hierarchies of Subregularly Tree Controlled Languages. DCFS 2008: 145-156 - Takashi Emori, Taishin Y. Nishida:
An Efficient Derivation Method for DTOL Systems and a Measure of Derivation Complexity. DCFS 2008: 157-167 - Zoltán Ésik, Yuan Gao, Guangwu Liu, Sheng Yu:
Estimation of State Complexity of Combined Operations. DCFS 2008: 168-181 - Hermann Gruber, Markus Holzer:
Language Operations with Regular Expressions of Polynomial Size. DCFS 2008: 182-193 - Xiaoxue Piao, Kai Salomaa:
Operational State Complexity of Nested Word Automata. DCFS 2008: 194-206
Short Papers
- András Faragó:
On the Descriptional Complexity of Path Optimization in Graphs. DCFS 2008: 207-215 - Lakshmanan Kuppusamy, Anand Mahendran, Kamala Krithivasan:
On the Trade-Off Between Ambiguity and Measures in Internal Contextual Grammars. DCFS 2008: 216-223 - Akihiro Matsuura, Yusuke Saito:
Equivalent Transformation of Minimal Finite Automata over a Two-Letter Alphabet. DCFS 2008: 224-232
a service of 
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.
last updated on 2024-04-22 20:01 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
