research
∙
08/09/2022
Co-lexicographically ordering automata and regular languages. Part I
In the present work, we lay out a new theory showing that all automata c...
share
research
∙
06/04/2021
On (co-lex) Ordering Automata
The states of a deterministic finite automaton A can be identified with ...
research
∙
02/12/2021
Which Regular Languages can be Efficiently Indexed?
In the present work, we study the hierarchy of p-sortable languages: reg...
research
∙
10/12/2018