Regular expressions. Closure properties. Sequential machines and finite state transducers. State minimization. Chomsky hierarchy grammars, pushdown acceptors and linear bounded automata. Closure ...

The bases of the human language faculty are now being investigated by means of highly specialised measurement techniques and with increasing success. Why can we understand complex sentences, while our ...

Using an asymptotic characterization of probabilistic finite state languages over a one-letter alphabet we construct a probabilistic language with regular support that cannot be generated by ...

One characteristic that clearly distinguishes us from non-human primates is our ability to understand and produce language. In particular, the human ability to apply complex linguistic rules has been ...