On Sub Regular OL Forms
Keyword(s):
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.
1986 ◽
Vol 23
(04)
◽
pp. 851-858
◽
1991 ◽
Vol 11
(1)
◽
pp. 65-71
◽