Conelikes and ranker comparisons
From MaRDI portal
Publication:6109018
DOI10.1007/978-3-031-20624-5_22arXiv2105.09346OpenAlexW3161255231MaRDI QIDQ6109018
Viktor Henriksson, Manfred Kufleitner
Publication date: 26 July 2023
Published in: LATIN 2022: Theoretical Informatics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2105.09346
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
- Sur le produit de concatenation non ambigu
- Pointlike sets: the finest aperiodic cover of a finite semigroup
- Pointlike sets with respect to R and J.
- On logical hierarchies within FO^2-definable languages
- The Join Levels of the Trotter-Weil Hierarchy Are Decidable
- INEVITABLE GRAPHS: A PROOF OF THE TYPE II CONJECTURE AND SOME RELATED DECISION PROCEDURES
- Structure Theorem and Strict Alternation Hierarchy for FO^2 on Words
- The pseudovariety $J$ is hyperdecidable
- An Effective Characterization of the Alternation Hierarchy in Two-Variable Logic
- Separating regular languages with first-order logic
- On Pointlike Sets and Joins of Pseudovarieties
- Block Products and Nesting Negations in FO2
- SC-hyperdecidability of \(\mathbf R\)
