default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID4. DCFS 2002: London, Ontario, Canada
- Jürgen Dassow, Maia Hoeberechts, Helmut Jürgensen, Detlef Wotschke:
Fourth International Workshop on Descriptional Complexity of Formal Systems - DCFS 2002, London, Canada, August 21 - 24, 2002. Pre-proceedings. Department of Computer Science, The University of Western Ontario, Canada 2002, ISBN 0-7714-2388-8
Invited Lectures
- Erzsébet Csuhaj-Varjú:
Descriptional Complexity Issues in Grammar Systems. DCFS 2002: 13-16 - Keith Ellul, Jeffrey O. Shallit, Ming-wei Wang:
Regular Expressions: New Results and Open Problems. DCFS 2002: 17-34 - Juris Hartmanis:
The Separation Problems and Descriptional Complexity. DCFS 2002: 35 - Lucian Ilie, Sheng Yu, Kaizhong Zhang:
Repetition Complexity of Words. DCFS 2002: 36 - Martin Kappes:
On Possible Extensions and Relationships Between Software Reliability, Software Metrics and Descriptional Complexity. DCFS 2002: 37-39
Workshop Contributions
- M. Sakthi Balan:
Complexity Issues in Binding-Blocking Automata. DCFS 2002: 43-54 - Henning Bordihn, Markus Holzer, Martin Kutrib:
Economy of Descriptions for Basic Constructions on Rational Transductions. DCFS 2002: 55-69 - Cezar Câmpeanu:
How Many States Can Have a Minimal DFA that Accepts Words of Length Less Than or Equal to l? DCFS 2002: 70-80 - Jean-Marc Champarnaud, Georges Hansel, Thomas Paranthoën, Djelloul Ziadi:
NFAs bitstream-based random generation. DCFS 2002: 81-94 - Michael Domaratzki, Kai Salomaa:
State Complexity of Shuffle on Trajectories. DCFS 2002: 95-109 - Mark G. Eramian:
Efficient Simulation of Nondeterministic Weighted Finite Automata. DCFS 2002: 110-122 - Cristian Grozea:
NP Predicates Computable in the Weakest Level of the Grzegorczyck Hierarchy. DCFS 2002: 123-132 - Lila Kari, Stavros Konstantinidis:
Descriptional Complexity of Error/Edit Systems. DCFS 2002: 133-147 - Madhu Mutyam:
Complexity Issues in Rewriting P Systems. DCFS 2002: 148-159 - Andreas Malcher:
On One-Way Cellular Automata with a Fixed Number of Cells. DCFS 2002: 160-173 - Andrew Martinez:
Efficient Computation of Regular Expressions from Unary NFAs. DCFS 2002: 174-187 - Ian McQuillan:
Descriptional Complexity of Block-Synchronization Context-Free Grammars. DCFS 2002: 188-203 - Charlotte L. Miller:
Context Derivation Sets and Context-Free Normal Forms. DCFS 2002: 204-215 - Mark-Jan Nederhof, Giorgio Satta:
Probabilistic Parsing Strategies. DCFS 2002: 216-230 - Frank Nießner:
Büchi automata and their degrees of nondeterminism and ambiguity. DCFS 2002: 231-245 - Taishin Y. Nishida:
Descriptional complexities of grammars over alphabets with finite parameters. DCFS 2002: 246-255 - Alexander Okhotin:
State complexity of linear conjunctive languages. DCFS 2002: 256-270
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-10-31 20:22 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:
