Browse by Topic

More Output

  1. A Subregular Bound on the Complexity of Lexical Quantifiers

    Graf, Thomas

    Abstract Semantic automata theory studies the complexity of generalized quantifiers in terms of the string languages that describe their truth conditions. An important point has gone unnoticed so far: for most quantifiers that are determiners, these string languages are subregular. Whereas quantifier phrases …

    read more