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]

Abstract

Abstract is missing.