On the State and Computational Complexity of the Reverse of Acyclic Minimal DFAs

Galina Jirásková, Tomás Masopust. On the State and Computational Complexity of the Reverse of Acyclic Minimal DFAs. In Nelma Moreira, Rogério Reis, editors, Implementation and Application of Automata - 17th International Conference, CIAA 2012, Porto, Portugal, July 17-20, 2012. Proceedings. Volume 7381 of Lecture Notes in Computer Science, pages 229-239, Springer, 2012. [doi]

@inproceedings{JiraskovaM12,
  title = {On the State and Computational Complexity of the Reverse of Acyclic Minimal DFAs},
  author = {Galina Jirásková and Tomás Masopust},
  year = {2012},
  doi = {10.1007/978-3-642-31606-7_20},
  url = {http://dx.doi.org/10.1007/978-3-642-31606-7_20},
  researchr = {https://researchr.org/publication/JiraskovaM12},
  cites = {0},
  citedby = {0},
  pages = {229-239},
  booktitle = {Implementation and Application of Automata - 17th International Conference, CIAA 2012, Porto, Portugal, July 17-20, 2012. Proceedings},
  editor = {Nelma Moreira and Rogério Reis},
  volume = {7381},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-642-31605-0},
}