The state complexity of a regular language is the number of states of its minimal determinitisc finite 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. ...

the favorable gains gleaned from the provision of pre-task planning time (ptp) have struck a chord with sla researchers as they try to manipulate task features to promote language production and development. in a similar vein, the present study is a two-fold attempt to first compare the effect of the length of pre-task planning time on discourse-analytic measures in narrative written production...

Abstract This paper analyzes three formal models of Transformer encoders that differ in the form their self-attention mechanism: unique hard attention (UHAT); generalized (GUHAT), which generalizes UHAT; and averaging (AHAT). We show UHAT GUHAT Transformers, viewed as string acceptors, can only recognize languages complexity class AC0, recognizable by families Boolean circuits constant depth po...