1 paper · 2 filters
Jean Néraud
Given an alphabet A and a binary relation τ ⊆ A * x A * , a language X ⊆ A * is τ-independent if τ (X) ∩ X = ∅; X is τ-closed if τ (X)…