Abstract
This note studies the conjecture that context-free matrix languages over one-letter alphabet are regular. We are able to confirm the conjecture in a special case where at most one non terminal can have an unbounded number of occurrences in sentential forms.
Get full access to this article
View all access options for this article.