Descriptional Complexity of Bounded Regular Languages

Andrea Herrmann, Martin Kutrib, Andreas Malcher, Matthias Wendlandt. Descriptional Complexity of Bounded Regular Languages. In Cezar Câmpeanu, Florin Manea, Jeffrey Shallit, editors, Descriptional Complexity of Formal Systems - 18th IFIP WG 1.2 International Conference, DCFS 2016, Bucharest, Romania, July 5-8, 2016. Proceedings. Volume 9777 of Lecture Notes in Computer Science, pages 138-152, Springer, 2016. [doi]

@inproceedings{HerrmannKMW16,
  title = {Descriptional Complexity of Bounded Regular Languages},
  author = {Andrea Herrmann and Martin Kutrib and Andreas Malcher and Matthias Wendlandt},
  year = {2016},
  doi = {10.1007/978-3-319-41114-9_11},
  url = {http://dx.doi.org/10.1007/978-3-319-41114-9_11},
  researchr = {https://researchr.org/publication/HerrmannKMW16},
  cites = {0},
  citedby = {0},
  pages = {138-152},
  booktitle = {Descriptional Complexity of Formal Systems - 18th IFIP WG 1.2 International Conference, DCFS 2016, Bucharest, Romania, July 5-8, 2016. Proceedings},
  editor = {Cezar Câmpeanu and Florin Manea and Jeffrey Shallit},
  volume = {9777},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-319-41113-2},
}