1 paper · 1 filter
Muhammad Inam
We show that if the Schützenberger graph of every positive word, that contains an R-word only once as it's subword, is finite over an Adain presentation ⟨X∣u=v⟩, t…