Consider the deterministic finite automaton (DFA) over the alphabet {a, b} and embodied by the transition diagram below. Use the table minimization algorithm provided in the lectures to determine which pairs of states are equivalent. Select the options below which are correct.

Consider the deterministic finite automaton (DFA) over the alphabet {a, b} and embodied by the transition diagram below. Use the table minimization algorithm provided in the lectures to determine which pairs of states are equivalent. Select the options below which are correct.

Consider the context-free grammar (CFG) G = (N,T,P,A) where N = {A,B}, T = {0,1,2}, the start symbol is A and the productions P are given below. Which of the following strings are valid left sentential forms of G?

A → A0B | 11A00 | 2

Consider the context-free grammar (CFG) G = (N,T,P,A) where N = {A,C,E}, T = {a,b,c,d,e,x}, the start symbol is A and the productions P are given below. Which of the words below (1-5) can be derived from G?

A -> a A b | C

Potential words:

1. x

Consider the pushdown automaton (PDA) embodied by the diagram below, which accepts by final state. Let us denote this PDA by P1. The PDA P1 has states {1,2}, alphabet symbols {a,b}, stack symbols {#,a,b}, transitions as depicted in the diagram, start state 1, initial stack symbol # and final state 2. Select all of the words below (from 1 to 6) which are accepted by P1.

Words:

1. aaabb

Consider the pushdown automaton (PDA) embodied by the diagram below, which accepts by final state. Let us denote this PDA by P1. The PDA P1 has states {1,2}, alphabet symbols {a,b}, stack symbols {#,a,b}, transitions as depicted in the diagram, start state 1, initial stack symbol # and final state 2. Select all of the words below (from 1 to 6) which are accepted by P1.

Words:

1. aaabb

Consider the pushdown automaton (PDA) embodied by the diagram below, which accepts by final state. Let us denote this PDA by P1. The PDA P1 has states {1,2}, alphabet symbols {a,b}, stack symbols {#,a,b}, transitions as depicted in the diagram, start state 1, initial stack symbol # and final state 2. Select all of the words below (from 1 to 6) which are accepted by P1.

Words:

1. aaabb

Consider the context-free grammar G1, with non-terminals {A}, terminals {0,1}, start symbol A, and  productions below. Select the language that G1 corresponds to.

A --> 0 A 1 | 1 A 0 | ε

Consider the pushdown automaton (PDA) embodied by the diagram below, which accepts by final state. Let us denote this PDA by P1. The PDA P1 has states {1,2}, alphabet symbols {a,b}, stack symbols {#,a,b}, transitions as depicted in the diagram, start state 1, initial stack symbol # and final state 2. If you were to modify the transitions labeled by a,b,ε and b,a,ε and were to modify them to a,b,ab and b,a,ba respectively, what consequence would this lead to?

Consider the pushdown automaton (PDA) embodied by the diagram below, which accepts by final state. Let us denote this PDA by P1. The PDA P1 has states {1,2}, alphabet symbols {a,b}, stack symbols {#,a,b}, transitions as depicted in the diagram, start state 1, initial stack symbol # and final state 2. Select all of the words below (from 1 to 6) which are accepted by P1.

Words:

1. aaabb