A Myhill-Nerode type theorem for higher-dimensional automata (HDAs) states that a language is regular if and only if it has finite prefix quotient.
