(80 points) Create a Finite Automata, Regular Expression and a Grammar for each of the following descriptions: • Accept

[answerhappygod]

80 Points Create A Finite Automata Regular Expression And A Grammar For Each Of The Following Descriptions Accept 1 (43.54 KiB) Viewed 45 times

(80 points) Create a Finite Automata, Regular Expression and a Grammar for each of the following descriptions: • Accept 00 and 11 at the end of a string containing 0, 1 in it, e.g., 01010100 but not 000111010. • Accept a string containing "the" anywhere in a string of [a-z), e.g., "there" but not "those". • Accept a string containing "ing" at the end of a string in a string of (a-z), e.g., "anything" but not "anywhere". • Let Σ = [a, b] and let L = [baa]. • Let E = (a, b) and let L = {we 2* | w* & and the first and last character of w are the same}. • Let Σ = (a, b) and let L = {we Z* | w is a nonempty string whose characters alternate between a's and b's ]. • Let E = (a, b, c) and let L = {we Σ* | some character in Σ appears at most twice in w}. • Set of all strings containing even number of a's and even number of b's over input alphabet [a,b]. (20 points) In the language of your choice write a program that takes in a file separates things into alphabet words, numbers, and specials symbols. This code should process the follow input as such: N":JFDSIFasssf401D78Gsy76s8a9sapl[ N -- word '-55 55 : - SS JFDSIFasssf -- word 4 -- number O-- word 1 -- number D -- word 78 -- Number Gsy -- Word 76 -- Number s-- word 8 -- Number a -- word 9 -- Number sapl word. [--S