Consider the NFA N1 below. Use the subset construction method in order to convert the NFA into a DFA. Which of the following DFA (i.e. D1, D2, D3 and D4) does the NFA N1 correspond to? Select the correct option below.

Given the DFA below, with states {Q1,Q2,Q3,Q4}, alphabet {a,b}, start state Q1, and final states {Q4}, which of the following words can be generated by the DFA?

Select the statements concerning the NFA embodied by the transition diagram below, which are TRUE.  

Consider the NFA N1 below. Use the subset construction method in order to convert the NFA into a DFA. Which of the following DFA (i.e. D1, D2, D3 and D4) does the NFA N1 correspond to? Select the correct option below.

Given the DFA below, with states {Q1,Q2,Q3,Q4}, alphabet {a,b}, start state Q1, and final states {Q4}, which of the following words can be generated by the DFA?

Select the statements concerning the NFA embodied by the transition diagram below, which are TRUE.  

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. 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

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.