Regular separability and intersection emptiness are independent decision problems: each can be decidable while the other is undecidable, on natural language classes.
An approach to regular separability in vector addition systems
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.FL 1years
2019 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
Regular Separability and Intersection Emptiness are Independent Problems
Regular separability and intersection emptiness are independent decision problems: each can be decidable while the other is undecidable, on natural language classes.