Decidability of "Skolem matrix emptiness problem" entails constructability of exact regular expressionMarek Karpinski1982Theoretical Computer Science