A deterministic automaton construction produces partial reductions for Kleene algebra with linear hypotheses, yielding completeness and decidability on every expression where it terminates.
In: FoSSaCS (2019)
1 Pith paper cite this work, alongside 15 external citations. Polarity classification is still indexing.
1
Pith paper citing it
15
external citations · OpenAlex
fields
cs.PL 1years
2026 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Partial Reductions for Kleene Algebra with Linear Hypotheses
A deterministic automaton construction produces partial reductions for Kleene algebra with linear hypotheses, yielding completeness and decidability on every expression where it terminates.