On the State Complexity of the Reverse of - and -Trivial Regular Languages

Galina Jirásková, Tomás Masopust. On the State Complexity of the Reverse of - and -Trivial Regular Languages. In Helmut Jürgensen, Rogério Reis, editors, Descriptional Complexity of Formal Systems - 15th International Workshop, DCFS 2013, London, ON, Canada, July 22-25, 2013. Proceedings. Volume 8031 of Lecture Notes in Computer Science, pages 136-147, Springer, 2013. [doi]

@inproceedings{JiraskovaM13,
  title = {On the State Complexity of the Reverse of - and -Trivial Regular Languages},
  author = {Galina Jirásková and Tomás Masopust},
  year = {2013},
  doi = {10.1007/978-3-642-39310-5_14},
  url = {http://dx.doi.org/10.1007/978-3-642-39310-5_14},
  researchr = {https://researchr.org/publication/JiraskovaM13},
  cites = {0},
  citedby = {0},
  pages = {136-147},
  booktitle = {Descriptional Complexity of Formal Systems - 15th International Workshop, DCFS 2013, London, ON, Canada, July 22-25, 2013. Proceedings},
  editor = {Helmut Jürgensen and Rogério Reis},
  volume = {8031},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-642-39309-9},
}