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
∙
09/11/2021
The Labeled Direct Product Optimally Solves String Problems on Graphs
Suffix trees are an important data structure at the core of optimal solu...
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
∙
02/26/2019
Adding the Power-Set to Description Logics
We explore the relationships between Description Logics and Set Theory. ...
research
∙
02/04/2019
On Prefix-Sorting Finite Automata
Being able to efficiently test the membership of a word in a formal lang...
research
∙
06/25/2018
Encoding Sets as Real Numbers (Extended version)
We study a variant of the Ackermann encoding N(x) := ∑_y∈ x2^N(y) of the...
research
∙
03/05/2018