Abstract
We present necessary and sufficient conditions for an OL form F to generate regular languages only. The conditions at issue can be effectively checked, whence the “regularity problem for OL forms” is proven decidable.
Get full access to this article
View all access options for this article.