Finite Automata Quiz

Finite Automata Quiz

University

10 Qs

quiz-placeholder

Similar activities

ATCD - MCQ - IAE1 Portions

ATCD - MCQ - IAE1 Portions

University

15 Qs

NFA Vs DFA

NFA Vs DFA

University

15 Qs

Kelompok 2 Finite State automata (FSA)

Kelompok 2 Finite State automata (FSA)

University

10 Qs

Maquina de Turing

Maquina de Turing

6th Grade - University

5 Qs

Quiz 5 Teori Bahasa dan Otomata-2023-1

Quiz 5 Teori Bahasa dan Otomata-2023-1

University

5 Qs

Quiz 5 Teori Bahasa dan Otomata 2021-2

Quiz 5 Teori Bahasa dan Otomata 2021-2

University

5 Qs

Tugas Pengganti Quiz 5 Teori Bahasa dan Otomata 2023-1

Tugas Pengganti Quiz 5 Teori Bahasa dan Otomata 2023-1

University

5 Qs

Finite Automata

Finite Automata

University

10 Qs

Finite Automata Quiz

Finite Automata Quiz

Assessment

Quiz

Computers

University

Medium

Created by

Smitha K

Used 5+ times

FREE Resource

10 questions

Show all answers

1.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

The finite automata is called NFA when their exist ________________for a specific input from the current state to the next.

Single path

multiple path

only two paths

none

2.

MULTIPLE CHOICE QUESTION

1 min • 1 pt

The Language described by the regular expression(0+1)*0(0+1)*0(0+1)* is the set of

All string containing atleast two 1's

All string containing atleast two 0's

All string that begin and end with either 0's or 1's

All string containing a substring 00

3.

MULTIPLE CHOICE QUESTION

45 sec • 1 pt

L1=Φ and L2={a} are the two languages. Out the following four options the one that represents L1 L2* υ L1* is

Φ

a*

ε

{ε, a}

4.

MULTIPLE CHOICE QUESTION

3 mins • 1 pt

Given a Turing Machine

M = ({q0,q1,q2,q3}, {a,b}, {a,b,B}, δ, B, {q3})

Where δ is a transition function defined as

δ(q0,a) = (q1,a,R)
δ(q1,b) = (q2,b,R)
δ(q2,a) = (q2,a,R)
δ(q2,b) = (q3,b,R)

The language L(M) accepted by the Turing Machine is given as:


aa*b

abab

aba*b

aba*

5.

MULTIPLE CHOICE QUESTION

3 mins • 1 pt

The context free grammar given by

S→XYX
X→aX|bX|λ
Y→bbb

generates the language which is defined by regular expression:


(a+b)*bbb

abbb(a+b)*

(a+b)*(bbb)(a+b)*

(a+b)(bbb)(a+b)*

6.

MULTIPLE CHOICE QUESTION

2 mins • 1 pt

The number of states in a minimal deterministic finite automaton corresponding to the language L = { an | n≥4 } is

3

4

5

6

7.

MULTIPLE CHOICE QUESTION

3 mins • 1 pt

Given the following productions of a grammar :

S→ aA| aBB;
A→aaA |λ ;
B→ bB| bbC;
C→ B

Which of the following is true ?

The language corresponding to the given grammar is a set of even number of a’s.

The language corresponding to the given grammar is a set of odd number of a’s.

The language corresponding to the given grammar is a set of even number of a’s followed by odd number of b’s.

The language corresponding to the given grammar is a set of odd number of a’s followed by even number of b’s.

Create a free account and access millions of resources

Create resources
Host any resource
Get auto-graded reports
or continue with
Microsoft
Apple
Others
By signing up, you agree to our Terms of Service & Privacy Policy
Already have an account?