Stem dol$ (all stems)

4 papers:

DLT-1993-DammHLR #complexity

Deterministic OL Languages are of Very Low Complexity: DOL is in AC0 (CD, MH, KJL, PR), pp. 305–313.

ICALP-1982-Karhumaki #equivalence #on the #problem

On the Equivalence Problem for Binary DOL Systems (JK), pp. 339–347.

STOC-1981-CulikH #decidability #equivalence #problem

The ω-Sequence Equivalence Problem for DOL Systems Is Decidable (KCI, TH), pp. 1–6.

ICALP-1976-Valiant #decidability #equivalence #problem

The Equivalence Problem for DOL Systems and its Decidability for Binary Alphabets (LGV), pp. 31–37.