5. DCFS 2003: Budapest, Hungary

Erzsébet Csuhaj-Varjú, Chandra M. R. Kintala, Detlef Wotschke, György Vaszil (Eds.): 5th International Workshop on Descriptional Complexity of Formal Systems - DCFS 2003, Budapest, Hungary, July 12 - 14, 2003. Proceedings. MTA SZTAKI, Hungarian Academy of Sciences, Budapest, Hungary 2003, ISBN 963-311-356-3

Invited Talks

Jozef Gruska: Succinctness in Quantum Information Processing. 15-25
Markus Holzer: On the Descriptional Complexity of Finite Automata With Modified Acceptance Conditions. 26-41
Alica Kelemenová: Descriptional Complexity of Eco-Grammar Systems. 42-52
Victor Mitrana: Some Complexity Aspects of Hybrid Networks of Evolutionary Processors. 53-65
Gheorghe Paun: Descriptional Complexity Issues in Membrane Computing. 66-77

Regular Papers

Henning Bordihn: On the Number of Components in Cooperating Distributed Grammar Systems. 81-89
Jean-Marc Champarnaud, Thomas Paranthoën: Random DFAs over a Non-Unary Alphabet. 90-101
Rudolf Freund, Marion Oswald, Petr Sosík: Reducing the Number of Catalysts Needed in Computationally Universal P Systems without Priorities. 102-113
Galina Jirásková: State Complexity of Some Operations on Regular Languages. 114-125
Martin Kappes, Frank Nießner: Succinct Representations of Languages by DFA With Different Levels of Reliability. 126-137
Martin Kutrib: On the Descriptional Power of Heads, Counters, and Pebbles. 138-149
Kuppuswamy Lakshmanan, Raghavan Rama: Descriptional Complexity of Rewriting Tissue P Systems. 150-161
Andreas Malcher: On Two-Way Communication in Cellular Automata With a Fixed Number of Cells. 162-173
Filippo Mera, Giovanni Pighizzini: Complementing Unary Nondeterministic Automata. 174-185
Ralf Stiebe: Positive Valence Grammars. 186-197
Bettina Sunckel: On the Descriptional Complexity of External Hybrid Cooperating Distributed Grammar Systems. 198-209
György Vaszil: On the Number of Conditional Productions in Simple Semi-conditional Grammars. 210-220
Sergey Verlan: A Frontier Result on Enhanced Time-Varying Distributed H Systems with Parallel Computations. 221-232

Papers with Short Presentation

Mark Daley, Ian McQuillan: Template-Guided DNA Recombination. 235-244
Pál Dömösi, Sándor Horváth, Masami Ito, Masashi Katsura: Some Remarks on Primitive Words and Palindromes. 245-254
Radu Gramatovici, Martin Plátek: Proper Dependency Grammars. 255-264
Maurice Margenstern, Gheorghe Paun, Yurii Rogozhin, Sergey Verlan: Context-Free Insertion-Deletion Systems. 265-273
Alexander Okhotin: On the Number of Nonterminals in Linear Conjunctive Grammars. 274-283
Mario J. Pérez-Jiménez, Álvaro Romero Jiménez, Fernando Sancho-Caparrini: A Polynomial Complexity Class in P Systems Using Membrane Division. 284-294
Holger Petersen: Complexity Results for Prefix Grammars. 295-302
Martin Plátek, Friedrich Otto, Frantisek Mráz: Restarting Automata and Variants of j-Monotonicity. 303-312

Last update Thu May 24 04:16:12 2012 CET by the DBLP Team —

Data released under the ODC-BY 1.0 license — See also our legal information page