default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID8. DCFS 2006: Las Cruces, New Mexico, USA
- 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
Invited Papers
- Piotr Faliszewski, Lane A. Hemaspaandra:
The Consequences of Eliminating NP Solutions. DCFS 2006: 1-15 - Vinod Chirayath, Luc Longpré:
Measuring privacy loss in statistical databases. DCFS 2006: 16-25 - Andreas Malcher:
Cellular Automata and Descriptional Complexity. DCFS 2006: 26-40 - Jeffrey O. Shallit:
New Directions in State Complexity. DCFS 2006: 41-45
Regular Papers
- 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 - 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 - Brendan J. Cordy, Kai Salomaa:
Regular Approximations of Non-Regular Languages. DCFS 2006: 118-129 - 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 - Yuan Gao, Kai Salomaa, Sheng Yu:
State Complexity of Catenation and Reversal Combined with Star. DCFS 2006: 153-164 - 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 - 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
Short Papers
- Cezar Câmpeanu, Andrei Paun, Jason R. Smith:
Tight Bounds for the State Complexity of Deterministic Cover Automata. DCFS 2006: 223-231 - Brian Cloteaux, Desh Ranjan:
Some Separation Results Between Classes of Pointer Algorithms. DCFS 2006: 232-240 - 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 - 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 - Hermann Gruber, Markus Holzer:
Results on the Average State and Transition Complexity of Finite Automata Accepting Finite Languages (Extended Abstract). DCFS 2006: 267-275 - Joachim Kupke:
A Powerful Tool in Lower-Bounding Constantly Ambiguous Automata. DCFS 2006: 276-284
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 2025-12-02 23:26 CET 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:
