Upper estimates of the finite-automation complexity of generalized regular expressions in a one-letter alphabet
From MaRDI portal
Publication:3970885
zbMATH Open0796.68094MaRDI QIDQ3970885
Author name not available (Why is that?)
Publication date: 25 June 1992
No records found.
No records found.
This page was built for publication: Upper estimates of the finite-automation complexity of generalized regular expressions in a one-letter alphabet
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3970885)
