1. Co-lexicographically Ordering Automata and Regular Languages - Part I.
- Author
-
COTUMACCIO, NICOLA, D'AGOSTINO, GIOVANNA, POLICRITI, ALBERTO, and PREZZA, NICOLA
- Abstract
Having established that the co-lex width of an automaton is a fundamental complexity measure, we proceed by (i) determining its computational complexity and (ii) extending this notion from automata to regular languages by studying their smallest-width accepting NFAs and DFAs. In this work we focus on the deterministic case and prove that a canonical minimum-width DFA accepting a language L-dubbed the Hasse automaton H of L-can be exhibited. H provides, in a precise sense, the best possible way to (partially) order the states of any DFA accepting L, as long as we want to maintain an operational link with the (colexicographic) order of L's prefixes. Finally, we explore the relationship between two conflicting objectives: minimizing the width and minimizing the number of states of a DFA. In this context, we provide an analogue of the Myhill-Nerode Theorem for co-lexicographically ordered regular languages. [ABSTRACT FROM AUTHOR]
- Published
- 2023
- Full Text
- View/download PDF