Regular languages have either bounded or logarithmic finite-horizon FO[<] quantifier rank depending on whether their syntactic monoid is aperiodic.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.FL 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Finite-Horizon First-Order Rank Profiles of Regular Languages
Regular languages have either bounded or logarithmic finite-horizon FO[<] quantifier rank depending on whether their syntactic monoid is aperiodic.