Interval logics and B-regular languages
From MaRDI portal
Publication:4910481
Recommendations
- Adding an equivalence relation to the interval logic \(AB\bar{B}\): complexity and expressiveness
- Adding one or more equivalence relations to the interval temporal logic \(\mathsf{AB}\overline{\mathsf{B}}\)
- Decidability of the interval temporal logic \(\operatorname{AB\overline{B}}\) over the natural numbers
- On begins, meets and before
- scientific article; zbMATH DE number 6131597
Cited in
(9)- Why systems of temporal logic are sometimes (un)useful?
- The Hybrid Plan Controller Construction for Trajectories in Sobolev Space
- An interval temporal logic characterization of extended \(\omega\)-regular languages
- scientific article; zbMATH DE number 3918353 (Why is no real title available?)
- Adding one or more equivalence relations to the interval temporal logic \(\mathsf{AB}\overline{\mathsf{B}}\)
- Beyond \(\omega \)-regular languages: \(\omega T\)-regular expressions and their automata and logic counterparts
- On a Temporal Logic of Prefixes and Infixes.
- Adding an equivalence relation to the interval logic \(AB\bar{B}\): complexity and expressiveness
- Beyond \(\omega BS\)-regular languages: \(\omega T\)-regular expressions and counter-check automata
This page was built for publication: Interval logics and \(\omega B\)-regular languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4910481)