How many times do you need to go back to the future in unary temporal logic?
From MaRDI portal
Publication:6109021
DOI10.1007/978-3-031-20624-5_25OpenAlexW4313141179MaRDI QIDQ6109021
Publication date: 26 July 2023
Published in: LATIN 2022: Theoretical Informatics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-031-20624-5_25
Algorithms in computer science (68Wxx) Theory of computing (68Qxx) Discrete mathematics in relation to computer science (68Rxx)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Deciding classes of regular languages: the covering approach
- Locally trivial categories and unambiguous concatenation
- Classifying regular events in symbolic logic
- Sur le produit de concatenation non ambigu
- The join of the pseudovarieties of \(\mathcal R\)-trivial and \(\mathcal L\)-trivial monoids
- Polynomial closure and unambiguous product
- Characterizing level one in group-based concatenation hierarchies
- Generic results for concatenation hierarchies
- The half-levels of the \(\mathrm {FO}_2\) alternation hierarchy
- First-order logic with two variables and unary temporal logic
- On logical hierarchies within FO^2-definable languages
- The Join Levels of the Trotter-Weil Hierarchy Are Decidable
- Separating Without Any Ambiguity.
- An Explicit Formula for the Intersection of Two Polynomials of Regular Languages
This page was built for publication: How many times do you need to go back to the future in unary temporal logic?
