default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID9. DCFS 2007: High Tatras, Slovakia
- Viliam Geffert, Giovanni Pighizzini:
9th International Workshop on Descriptional Complexity of Formal Systems - DCFS 2007, High Tatras, Slovakia, July 20 - 22, 2007. University of Kosice, Slovakia 2007, ISBN 978-80-7097-688-3
Invited Papers
- Helmut Jürgensen:
Complexity, Information, Energy. DCFS 2007: 7-11 - Carlo Mereghetti:
The Descriptional Power of Sublogarithmic Resource Bounded Turing Machines. DCFS 2007: 12-26 - Markus E. Nebel:
Compact Descriptions for Efficient Algorithms. DCFS 2007: 27-40 - Jirí Wiedermann, Dana Pardubská:
Wireless Parallel Computing and its Links to Descriptive Complexity. DCFS 2007: 41-56
Regular Papers
- Marco Almeida, Nelma Moreira, Rogério Reis:
Exact Generation of Minimal Acyclic Deterministic Finite Automata. DCFS 2007: 57-68 - Rudolf Freund, Marion Oswald:
CD Grammar Systems with Regular Start Conditions. DCFS 2007: 69-80 - Martin Kutrib, Jens Reimann:
Optimal Simulations of Weak Restarting Automata. DCFS 2007: 81-92 - Remco Loos, Andreas Malcher, Detlef Wotschke:
Descriptional Complexity of Splicing Systems. DCFS 2007: 93-104 - Taishin Y. Nishida:
Descriptional Complexities of Grammars over Alphabets with Finite Parameters. DCFS 2007: 105-116 - Beatrice Palano:
A Regularity Condition for Context-Free Grammars. DCFS 2007: 117-128 - Gheorghe Paun, Mario J. Pérez-Jiménez, Takashi Yokomori:
Representations and Characterizations of Languages in Chomsky Hierarchy by Means of Insertion-Deletion Systems. DCFS 2007: 129-140 - Bianca Truthe:
Remarks on Context-Free Parallel Communicating Grammar Systems Generating Crossed Agreements. DCFS 2007: 141-152
Short Papers
- Kostyantyn Archangelsky:
A New Measure of Descriptional Complexity of Languages and Formal Power Series: Compactness. DCFS 2007: 153-161 - Jürgen Dassow, Ralf Stiebe:
Nonterminal Complexity of Some Operations on Context-Free Languages. DCFS 2007: 162-169 - Tomás Masopust, Alexander Meduna:
Descriptional Complexity of Generalized Forbidding Grammars. DCFS 2007: 170-177 - Alexander Meduna, Jirí Techet:
Reduction of Scattered Context Generators of Sentences Preceded by Their Leftmost Parses. DCFS 2007: 178-185
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-20 23:46 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:
