Three theorems concerning principal AFLs

Authors:
J. S. Ullian
Affiliations:
Dept. of Philosophy, Washington University, St. Louis, Missouri 63130, USA
Venue:
Journal of Computer and System Sciences
Year:
1971

Citing 2
Cited 3

Three theorems on abstract families of languages

STOC '70 Proceedings of the second annual ACM symposium on Theory of computing
The Mathematical Theory of Context-Free Languages

The Mathematical Theory of Context-Free Languages

Some independent families of one-letter languages

Journal of Computer and System Sciences
Proving containment of bounded AFL

Journal of Computer and System Sciences
Bounded AFLs

Journal of Computer and System Sciences

Quantified Score

Hi-index	0.00

Visualization

Abstract

o(1)If every set in @? is a subset of a^* and the empty word belongs to one of them, then . One consequence is that is always principal for . (2)On the other hand, there is a language such that is not principal. (3)There are subsets J and K of a^* such that is not principal.