| Friday, July 20, 2001 | |
|---|---|
| 09:05-17:15 | Common sessions with DLT 2001. For the program see http://www.emcc.at/dlt-2001/programm.html |
| 18:00 | Reception by the Rektor of Technische Universität Wien |
| Saturday, July 21, 2001 | |
|---|---|
| 09:00-10:00 | Invited Lecture: J. Hromkovic
(Aachen):
Descriptional Complexity of Regular Languages (Concepts and Open Problems) |
| 10:00-10:25 | Coffee Break |
| 10:25-10:50 | M. Domaratzki (Kingston, Ontario),
D. Kisman (Toronto, Ontario), J. Shallit (Waterloo,
Ontario):
On the Number of Distinct Languages Accepted by Finite Automata with n States |
| 10:50-11:15 | C. Mereghetti (Milano), B.
Palano (Torino), G. Pighizzini (Milano):
On the Succinctness of Deterministic, Nondeterministic, Probabilistic and Quantum Finite Automata |
| 11:15-11:40 | A. Malcher (Frankfurt/Main):
Descriptional Complexity of Cellular Automata and Decidability Questions |
| 11:40-12:05 |
P. Séébold (Amiens):
Some Properties of the Prouhet Morphisms and Words |
| 12:05-14:00 | Lunch |
| 14:00-14:25 | H. Leung, V. Podolskiy (Las Cruces,
New Mexico):
The Limitedness Problem on Distance Automata |
| 14:25-14:50 | K. Hashiguchi, T. Kunai, S. Jimbo
(Okayama):
Finite Codes over Free Binoids |
| 14:50-15:15 | M. Kutrib (Giessen):
Refining Nondeterminism Below Linear-Time |
| 15:15-15:40 |
M. Plátek, F. Mráz (Praha): Degrees of (Non)Monotonicity of RRW-Automata |
| 15:40-16:05 |
F.L. Tiplea (Iasi), E. Mäkinen (Tampere): On the Complexity of a Problem on Monadic String Rewriting Systems |
| 16:05-16:25 | Coffee Break |
| 16:25-16:50 |
K. Arthi, K. Krithivasan (Madras),
E. Csuhaj-Varjú (Budapest): On the Number of Rules in Components of Cooperating Distributed Grammar Systems with Probabilities |
| 16:50-17:15 |
H. Bordihn (Potsdam), B. Reichel (Magdeburg): On Descriptions of Context-Free Languages by CD Grammar Systems |
| 17:15-17:40 |
H. Fernau (Tübingen), M. Holzer (München): Graph-Controlled Cooperating Distributed Grammar Systems with Singleton Components |
| 17:40-18:05 |
M. Sakthi Balan (Madras): Parallel Communicating Pushdown Automata with Filters in Communication |
| 18:15-19:15 | Business Meeting of IFIP Working Group 1.2 Descriptional Complexity |
| Sunday, July 22, 2001 | |
|---|---|
| 09:00-10:00 | Invited Lecture: A. Meduna
(Brno):
Descriptional Complexity of Partially Parallel Grammars |
| 10:00-10:20 | Coffee Break |
| 10:20-10:45 |
C. Martín-Vide (Tarragona), V. Mitrana (Bucuresti): Grammars with Bounded-Life Resources |
| 10:45-11:10 |
J. Neumann, A. Szepietowski (Gdansk): The Emptiness Problem for Weak Rabin Tree Automata |
| 11:10-11:35 |
M. Domaratzki (Kingston, Ontario): State Complexity and Proportional Removals |
| 11:35-12.00 |
H.N. Adorna (Aachen): 3-Party Message Complexity is Better than 2-Party Ones for Proving Lower Bounds on the Size of Minimal Nondeterministic Finite Automata |
| DCAGRS 2001 Homepage |
| Bernd Reichel, Magdeburg 05.06.2001 |