Proceedings Twelfth Annual Workshop on Descriptional Complexity of Formal Systems, DCFS 2010, Saskatoon, Canada, 8-10th August 2010

@inproceedings{McQuillan2010ProceedingsTA,
  title={Proceedings Twelfth Annual Workshop on Descriptional Complexity of Formal Systems, DCFS 2010, Saskatoon, Canada, 8-10th August 2010},
  author={Ian McQuillan and Giovanni Pighizzini},
  booktitle={Workshop on Descriptional Complexity of Formal Systems},
  year={2010}
}
The 12th annual workshop, Descriptional Complexity of Formal Systems 2010, is taking place in Saskatoon, Canada, on August 8-10, 2010. It is jointly organized by the IFIP Working Group 1.2 on Descriptional Complexity and by the Department of Computer Science at the University of Saskatchewan. This volume contains the papers of the invited lectures and the accepted contributions. 
1 Citations

Descriptional Complexity of Power and Positive Closure on Convex Languages

The description of a binary factor-closed language meeting the upper bound kn for the k-th power and some results concerning the deterministic state complexity of these two operations on the classes of free, ideal, and closed languages.