The document discusses the construction of finite automata (FA) using properties of regular languages, specifically focusing on closure properties. It outlines four specific automata: one recognizing RNA sequences with subsequences 'ata' and 'tga', another for words starting with 'an' but not ending with 'ed', a third for the reverse of the second type, and a fourth for strings that do not start with 'ba' or end with 'th'. The emphasis is on the application of regular language properties in automata design.

1. Using the properties of Regular languages, mention which properties (i.e. the closure under
certain operations) that help in constructing the following finite automata:
1- The FA that recognizes all RNA sequences that contain the subsequence ATA and also
contains the subsequence TGA
2- The FA that recognizes all the words that start with an but do not end with ed
3- The FA that recognizes all the strings that are a reverse of those in question 2.
4- The FA that recognizes all the strings that do not start with ba or do not end with th