logo

Crowdly

Browser

Додати до Chrome

Languages and Computation (COMP2040 UNMC) (SPM1 25-26)

Шукаєте відповіді та рішення тестів для Languages and Computation (COMP2040 UNMC) (SPM1 25-26)? Перегляньте нашу велику колекцію перевірених відповідей для Languages and Computation (COMP2040 UNMC) (SPM1 25-26) в moodle.nottingham.ac.uk.

Отримайте миттєвий доступ до точних відповідей та детальних пояснень для питань вашого курсу. Наша платформа, створена спільнотою, допомагає студентам досягати успіху!

Given the non-deterministic finite automaton embodied by the diagram below, which of the following statements is 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. Select all of the words below (from 1 to 6) which are accepted by P1.

Words:

1. aaabb

2. abaa

3. baab

4. a

5. ababab

6. bbaba

Переглянути це питання

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

DFA.

Переглянути це питання

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?

DFA.

0%
0%
0%
0%
Переглянути це питання

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

A simple NFA.

Переглянути це питання

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?

DFA.

Переглянути це питання

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

A simple NFA.

0%
0%
0%
Переглянути це питання

Хочете миттєвий доступ до всіх перевірених відповідей на moodle.nottingham.ac.uk?

Отримайте необмежений доступ до відповідей на екзаменаційні питання - встановіть розширення Crowdly зараз!

Browser

Додати до Chrome