Towards Compact and Tractable Automaton-based Representations of Time Granularity

Ugo Dal Lago (1) , Angelo Montanari (2) , Gabriele Puppis (3)

1 DISI - Dipartimento di Scienze dell'Informazione [Bologna]
2 DIMI - Dipartimento di Matematica e Informatica - Universita Udine
3 LaBRI - Laboratoire Bordelais de Recherche en Informatique

Different approaches to time granularity have been proposed in the database literature to formalize the notion of calendar, based on algebraic, logical, and string-based formalisms. In this paper, we further develop an alternative approach based on automata, originally proposed in [4], which makes it possible to deal with infinite time granularities in an effective (and efficient) way. In particular, such an approach provides an effective solution to fundamental problems such as equivalence and conversion of time granularities. We focus our attention on two kinds of optimization problems for automaton-based representations, namely, computing the smallest representation and computing the most tractable representation, that is, the one on which crucial algorithms (e.g., granule conversion algorithms) run fastest. We first introduce and compare these two minimization problems; then, we give a polynomial time algorithm that solves the latter.

Domaines: Théorie et langage formel [cs.FL]

Ugo Dal Lago, Angelo Montanari, Gabriele Puppis. Towards Compact and Tractable Automaton-based Representations of Time Granularity. 8th Italian Conference on Theoretical Computer Science (ICTCS), 2003, Bologna, Italy. pp.72-85. ⟨hal-00878407⟩