UPEI
10th International Workshop on Descriptional Complexity of Formal Systems
Charlottetown, CANADA July 16-18, 2008
IFIP   
 
The Workshop  
News  
Call for Papers  
Topics  
Submissions  
Proceedings  
Important Dates  
Invited Speakers  
Steering Committee  
Program Committee  
Organization  
Previous DCFSs  
Related Conferences  
Location (Venue)  
Travelling Information  
Accommodation  
Accepted Papers  
Timetable  
Photo Gallery  
Participants  
Registration  
Contact  
Timetable
 

Lectures take place in the new Bussines Building Marian Hall 242.
On the Campus Map the building can be identified as number 17. Lecture theatre 242 is the located near the entrance from Kelly Building (number 13 on the map).

The registration and all other problems related to registration can be solved in CASS 312.

Printable version of the program

Wednesday, July 16, 2008

8:00-9:00Registration
9:00-9:20Opening
9:30-10:30Automata-like membrane systems - A natural way to describe complex phenomenaGyorgy Vaszil
10:30-11:00Coffee Break
11:00-11:30State-Complexity Hierarchies of Uniform Languages of Alphabet-Size LengthJanusz Brzozowski and Stavros Konstantinidis
11:30-12:00State Complexity of NFA to DFA Conversion for Subregular Language FamiliesHenning Bordihn, Markus Holzer, Martin Kutrib
12:00-13:30Lunch
14:00-14:30On Two Hierarchies of Subregularly Tree Controlled LanguagesJürgen Dassow and Bianca Truthe
14:30-15:00Computational Completeness of Hybrid Networks of Evolutionary Processors with Seven NodesArtiom Alhazov, Erzsébet Csuhaj-Varjú, Carlos Martín-Vide, and Yurii Rogozhin
15:00-15:30Language Operations with Regular Expressions of Polynomial SizeHermann Gruber and Markus Holzer
15:30-16:00Coffee Break
16:00-16:30On Leftmost #-Rewriting SystemsMaria Paola Bianchi and Beatrice Palano
16:30-17:00An Efficient Derivation Method for DT0L Systems and a Measure of Derivation ComplexityTakashi Emori and Taishin Y. Nishida
17:00-17:20Equivalent Transformation of Minimal Finite Automata over a Two-Letter AlphabetAkihiro Matsuura, and Yusuke Saito
18:30Welcome Party

Thursday, July 17, 2008

9:00-10:00Non-regularity, Approximation and State ComplexityBalasubramanian Ravikumar
10:00-10:30Determinism without DeterminizationJanusz Brzozowski and Nicolae Santean
10:30-11:00Coffee Break
11:00-11:30Watson-Crick automata: determinism and state complexityElena Czeizler, Eugen Czeizler, Lila Kari, and Kai Salomaa
11:30-11:50On the Descriptional Complexity of Path Optimization in GraphsAndras Farago
12:00-13:30Lunch
13:30 - 18:00Social Event
18:00-20:00Conference Dinner

Friday, July 18, 2008

9:00-10:00Circuit Complexity, Kolmogorov Complexity, and Prospects for Lower BoundsEric Allender
10:00-10:30Estimation of State Complexity of Combined OperationsZoltan Esik, Yuan Gao, Guangwu Liu, and Sheng Yu
10:30-11:00Coffee Break
11:00-12:00Incompleteness: A Personal PerspectiveCristian Calude
12:00-13:30Lunch
14:00-14:30Operational State Complexity of Nested AutomataXiaoxue Piao and Kai Salomaa
14:30-15:00On the Synchronized Derivation Depth of Context-Free GrammarsFranziska Biegler and Kai Salomaa
15:00-15:30Coffee Break
15:30-16:00State Complexity of Orthogonal CatenationMark Daley, Michael Domaratzki, and Kai Salomaa
16:00-16:30Exact Generation of Acyclic Deterministic Finite AutomataMarco Almeida, Nelma Moreira, and Rogério Reis
16:30Bussiness Meeting
18:00Goodbye Party
 


Last modified: Monday April 25, 2016 at 03:18 pm AST
DCFS 2008