On Regular Expression Proof Complexity

Simon Beier, Markus Holzer 0001. On Regular Expression Proof Complexity. In Émilie Charlier, Julien Leroy 0002, Michel Rigo, editors, Developments in Language Theory - 21st International Conference, DLT 2017, Liège, Belgium, August 7-11, 2017, Proceedings. Volume 10396 of Lecture Notes in Computer Science, pages 83-95, Springer, 2017. [doi]

@inproceedings{Beier017,
  title = {On Regular Expression Proof Complexity},
  author = {Simon Beier and Markus Holzer 0001},
  year = {2017},
  doi = {10.1007/978-3-319-62809-7_5},
  url = {https://doi.org/10.1007/978-3-319-62809-7_5},
  researchr = {https://researchr.org/publication/Beier017},
  cites = {0},
  citedby = {0},
  pages = {83-95},
  booktitle = {Developments in Language Theory - 21st International Conference, DLT 2017, Liège, Belgium, August 7-11, 2017, Proceedings},
  editor = {Émilie Charlier and Julien Leroy 0002 and Michel Rigo},
  volume = {10396},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-319-62809-7},
}