Decidability of “Skolem matrix emptiness problem” entails constructability of exact regular expression
Marek KarpinskiVolume:
17
Year:
1982
Language:
english
Pages:
4
DOI:
10.1016/0304-3975(82)90134-7
File:
PDF, 414 KB
english, 1982