Compact and tractable automaton-based representations of time granularities

DOI10.1016/J.TCS.2006.12.014zbMath1111.68053OpenAlexW2099060435MaRDI QIDQ875518

Ugo Dal Lago, Angelo Montanari, Gabriele Puppis

Publication date: 13 April 2007

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2006.12.014

zbMATH Keywords

automatatemporal databasestime granularities

Mathematics Subject Classification ID

Database theory (68P15) Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (1)

A theory of ultimately periodic languages and automata with an application to time granularity

Uses Software

• LaGO

Cites Work

• An algebraic representation of calendars
• Solving multi-granularity temporal constraint networks
• Fast Pattern Matching in Strings
• Representing and Reasoning about Temporal Granularities
• Temporalized logics and automata for time granularity
• Uniqueness Theorems for Periodic Functions
• Ultimately periodic words of rational ω-languages
• Theoretical Computer Science
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Compact and tractable automaton-based representations of time granularities