The finite automata accept the following languages:...

MCQ

The finite automata accept the following languages:

Context Free Languages

Context Sensitive Languages

Regular Languages

All the mentioned

Community Discussion

No discussions yet. Be the first to start!

You must be logged in to participate in the discussion.

Similar Questions

MCQ

The set of all strings over ? = {a,b} in which all strings of a

a*bbb

(a+b)* bb

All of these

Discussion

MCQ

Regular expression (x/y)(x/y) denotes the set

{xy,xy}

{xx,xy,yx,yy}

{x,y}

{x,y,xy}

Discussion

MCQ

L is a regular Language if and only If the set of __________ classes of IL is finite.

Equivalence

Reflexive

Myhill

Nerode

Discussion

MCQ

Number of states of FSM required to simulate behaviour of a computer with a memory capable of storing

m x 2ⁿ

2^mn

2^(m+n)

all of the mentioned

Discussion

MCQ

The given NFA corresponds to which of the following Regular expressions?

(0+1) *(00+11) (0+1) *

(0+1) *(00+11) *(0+1) *

(0+1) *(00+11) (0+1)

(0+1) (00+11) (0+1) *

Discussion

Banking

Engineering

General

Medical

Question Discussion & Solution

Report Error

Community Discussion

Similar Questions

Report Error

Report Error

Report Error

Report Error

Report Error

More Theory of Automata Topics

Reqular Expressions

Finite Automata

Context Free Grammars

Push Down Automata

Regular and context free languages

Pumping Lemma

Turning Machine

Banking

Engineering

General

Medical

Question Discussion & Solution

report Report Error

forum Community Discussion

auto_awesome Similar Questions

report Report Error

report Report Error

report Report Error

report Report Error

report Report Error

category More Theory of Automata Topics

Reqular Expressions

Finite Automata

Context Free Grammars

Push Down Automata

Regular and context free languages

Pumping Lemma

Turning Machine

Report Error

Community Discussion

Similar Questions

Report Error

Report Error

Report Error

Report Error

Report Error

More Theory of Automata Topics