The paper defines reordering derivatives that build automata for trace closures of regular languages, proving finiteness for star-connected expressions and for languages with finite uniform scattering rank.
Characterizations of the decidability of some problems for regular trace languages
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
-
Reordering Derivatives of Trace Closures of Regular Languages (Full Version)
The paper defines reordering derivatives that build automata for trace closures of regular languages, proving finiteness for star-connected expressions and for languages with finite uniform scattering rank.