On the complexity of computing the co-lexicographic width of a regular language

DOI10.1016/J.JCSS.2026.103759MaRDI QIDQ6845959zbMATH OpenFDO

Authors Ruben Becker, Davide Cenzato, SungHwan Kim, Tomasz Kociumaka, Bojana Kodric, Alberto Policriti, Nicola Prezza

Publication date 12 March 2026

Published in Journal of Computer and System Sciences (Search for Journal in Brave)

zbMATH Keywords

parameterized complexitysortingregular languagesindexingWheeler automata

Mathematics Subject Classification ID

Computer science (68-XX)

This page was built for publication: On the complexity of computing the co-lexicographic width of a regular language

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6845959)