Interval logics and ωb-regular languages

16Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In the recent years, interval temporal logics are emerging as a workable alternative to more standard point-based ones. In this paper, we establish an original connection between these logics and ωB-regular languages. First, we provide a logical characterization of regular (resp., ω-regular) languages in the interval logic of Allen's relations meets, begun by, and begins over finite linear orders (resp., ℕ). Then, we lift such a correspondence to ωB-regular languages by substituting for (is obtained from by adding a modality for Allen's relation met by). In addition, we show that new classes of extended (ω-)regular languages can be naturally defined in. © 2013 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Montanari, A., & Sala, P. (2013). Interval logics and ωb-regular languages. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7810 LNCS, pp. 431–443). Springer Verlag. https://doi.org/10.1007/978-3-642-37064-9_38

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free