Decidability of "Skolem matrix emptiness problem" entails constructability of exact regular expression
- Marek Karpinski
- 1982
- Theoretical Computer Science
This is our catalog of publications authored by IBM researchers, in collaboration with the global research community. It’s an ever-growing body of work that shows why IBM is one of the most important contributors to modern computing.