A Language-Theoretic Approach to the Heapability of Signed Permutations

Gabriel Istrate. A Language-Theoretic Approach to the Heapability of Signed Permutations. In Jan Holub 0001, Jan Zdárek, editors, Prague Stringology Conference 2024, Prague, Czech Republic, August 26-27, 2024. pages 71-85, Czech Technical University in Prague, Faculty of Information Technology, Department of Theoretical Computer Science, 2024. [doi]

@inproceedings{Istrate24,
  title = {A Language-Theoretic Approach to the Heapability of Signed Permutations},
  author = {Gabriel Istrate},
  year = {2024},
  url = {http://www.stringology.org/event/2024/p07.html},
  researchr = {https://researchr.org/publication/Istrate24},
  cites = {0},
  citedby = {0},
  pages = {71-85},
  booktitle = {Prague Stringology Conference 2024, Prague, Czech Republic, August 26-27, 2024},
  editor = {Jan Holub 0001 and Jan Zdárek},
  publisher = {Czech Technical University in Prague, Faculty of Information Technology, Department of Theoretical Computer Science},
  isbn = {978-80-01-07328-5},
}