Proceedings Eleventh International Workshop on Descriptional Complexity of Formal Systems
J\"urgen Dassow, Giovanni Pighizzini, Bianca Truthe
TL;DR
This workshop compiles recent research on the descriptional complexity of formal systems, highlighting advances in understanding the complexity measures and their implications in theoretical computer science.
Contribution
It presents a collection of invited lectures and accepted papers that showcase new findings and methodologies in the descriptional complexity of formal systems.
Findings
New complexity bounds for formal automata
Improved algorithms for state minimization
Insights into the computational resources needed for formal descriptions
Abstract
The 11th workshop, Descriptional Complexity of Formal Systems 2009, is taking place in Magdeburg, Germany, on July 6-9, 2009. It is jointly organized by the IFIP Working Group 1.2 on Descriptional Complexity and by the Faculty of Computer Science at the Otto von Guericke University Magdeburg. This volume contains the papers of the invited lectures and the accepted contributions.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.