The Internet Archive has a preservation copy of this work in our general collections.
The file type is
The syntactic complexity of a regular language is the cardinality of its syntactic semigroup. The syntactic complexity of a subclass of regular languages is the maximal syntactic complexity of languages in that subclass, taken as a function of the state complexity of these languages. We study the syntactic complexity of star-free regular languages, that is, languages that can be constructed from finite languages using union, complement and concatenation. We find tight upper bounds on thearXiv:1109.3381v1 fatcat:xdoe2qmlpjcq5j4y7s3jc7dhnm