Arseny M. Shur. Combinatorial Complexity of Regular Languages. In Edward A. Hirsch, Alexander A. Razborov, Alexei L. Semenov, Anatol Slissenko, editors, Computer Science - Theory and Applications, Third International Computer Science Symposium in Russia, CSR 2008, Moscow, Russia, June 7-12, 2008, Proceedings. Volume 5010 of Lecture Notes in Computer Science, pages 289-301, Springer, 2008. [doi]
@inproceedings{Shur08, title = {Combinatorial Complexity of Regular Languages}, author = {Arseny M. Shur}, year = {2008}, doi = {10.1007/978-3-540-79709-8_30}, url = {http://dx.doi.org/10.1007/978-3-540-79709-8_30}, researchr = {https://researchr.org/publication/Shur08}, cites = {0}, citedby = {0}, pages = {289-301}, booktitle = {Computer Science - Theory and Applications, Third International Computer Science Symposium in Russia, CSR 2008, Moscow, Russia, June 7-12, 2008, Proceedings}, editor = {Edward A. Hirsch and Alexander A. Razborov and Alexei L. Semenov and Anatol Slissenko}, volume = {5010}, series = {Lecture Notes in Computer Science}, publisher = {Springer}, isbn = {978-3-540-79708-1}, }