Nondeterministic Complexity of Operations on Closed and Ideal Languages

Michal Hospodár, Galina Jirásková, Peter Mlynárcik. Nondeterministic Complexity of Operations on Closed and Ideal Languages. In Yo-Sub Han, Kai Salomaa, editors, Implementation and Application of Automata - 21st International Conference, CIAA 2016, Seoul, South Korea, July 19-22, 2016, Proceedings. Volume 9705 of Lecture Notes in Computer Science, pages 125-137, Springer, 2016. [doi]

@inproceedings{HospodarJM16,
  title = {Nondeterministic Complexity of Operations on Closed and Ideal Languages},
  author = {Michal Hospodár and Galina Jirásková and Peter Mlynárcik},
  year = {2016},
  doi = {10.1007/978-3-319-40946-7_11},
  url = {http://dx.doi.org/10.1007/978-3-319-40946-7_11},
  researchr = {https://researchr.org/publication/HospodarJM16},
  cites = {0},
  citedby = {0},
  pages = {125-137},
  booktitle = {Implementation and Application of Automata - 21st International Conference, CIAA 2016, Seoul, South Korea, July 19-22, 2016, Proceedings},
  editor = {Yo-Sub Han and Kai Salomaa},
  volume = {9705},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-319-40945-0},
}