A connection between String Covers and Cover Deterministic Finite Tree Automata Minimization

by   Alexandru Popa, et al.

Data compression plays a crucial part in the cloud based systems of today. One the fundaments of compression is quasi-periodicity, for which there are several models. We build upon the most popular quasi-periodicity model for strings, i.e., covers, generalizing it to trees. We introduce a new type of cover automata, which we call Deterministic Tree Automata. Then, we formulate a cover problem on these DTA and study its complexity, in both sequential and parallel settings. We obtain bounds for the Cover Minimization Problem. Along the way, we uncover an interesting application, the Shortest Common Cover Problem, for which we give an optimal solution.




An output-sensitive algorithm for the minimization of 2-dimensional String Covers

String covers are a powerful tool for analyzing the quasi-periodicity of...

Computing Covers under Substring Consistent Equivalence Relations

Covers are a kind of quasiperiodicity in strings. A string C is a cover ...

Sequentiality of String-to-Context Transducers

Transducers extend finite state automata with outputs, and describe tran...

Covering Metric Spaces by Few Trees

A tree cover of a metric space (X,d) is a collection of trees, so that ...

Parameterized Vietoris-Rips Filtrations via Covers

A challenge in computational topology is to deal with large filtered geo...

Interpreting Finite Automata for Sequential Data

Automaton models are often seen as interpretable models. Interpretabilit...

Large Scale Geometries of Infinite Strings

We introduce geometric consideration into the theory of formal languages...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.