Construct deterministic finite automatons (DFAS) which describes or recognizes the languages given. The underlying alphabet is = (0, 1). Be sure to give DFAS and not NFAS. L1 = The set of all strings of 0's and 1's not containing 101 as a substring. L2 = (On1m0mln | n, m >=0}. L3 = Construct a DFA that would accept last digits either 00 or 11. L4 = Set of all strings such that each block of five consecutive symbols contains at least two 1's %3D L5 The set of strings that either begin or end (or both) with 010

Draw a deterministic finite automaton (DFA) that recognizes the language consisting of strings overthe alphabet {a,b} which contain either exactly two a's (which need not be consecutive) and anynumber of b's, or exactly two b's (which need not be consecutive) and any number of a's (and containsonly such strings.) Use JFLAP and submit the saved file.

Consider the language consisting of all strings of properly balanced square brackets. The context freegrammar G is defined as follows:1. <Goal> ::= < List >2. <List> ::= < Pair > < List >3. <List> ::= ε4. <Pair> ::= [ <List> ]Note that EOF is the token that immediately follows the start symbol <Goal> and it means end offile (EOF), representing the end of an input sentence. Therefore you can assume FOLLOW{<Goal>} ={EOF}.   (a) Give the FIRST sets of <List>, <Goal>, and <Pair>.   (b) Give the FOLLOW set of <List>.

use this link to simulate http:// automatonsimulator.com/