Noname manuscript No. (will be inserted by the editor) Some Properties of Iterated Languages

the date of receipt and acceptance should be inserted later Abstract A special kind of substitution on languages called iteration is presented and studied. These languages arise in the application of semantic automata to iterations of generalized quantifiers. We show that each of the star-free, regular, and deterministic context-free languages are closed under iteration and that it is decidable whether a given regular or determinstic context-free language is an iteration of two such languages. This result can be read as saying that the van Benthem / Keenan ‘Frege Boundary ’ is decidable for large subclasses of natural language quantifiers. We also determine the state complexity of iteration of regular languages. Keywords semantic automata · generalized quantifiers · iteration · Frege boundary · decidabilit