We describe the use of finite state automata for the description of natural languages. We demonstrate the use of this model of grammar through linguistically varied examples, from time adverbials and sentential determiners to elementary sentences of a lexicon-grammar