The state complexity of a regular language is the number of states of its minimal automaton. The complexity of a language operation is the complexity of the resulting language seen as a function of the complexities of the operation arguments. In this report we review some of the results of state complexity of individual operations for regular and some subregular languages.