A language is 2detLIN if and only if it has a finite, complete, crossing-free prefix-suffix classification.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.FL 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
A Myhill-Nerode Type Characterization of 2detLIN Languages
A language is 2detLIN if and only if it has a finite, complete, crossing-free prefix-suffix classification.