Question: Under which of the following operation, NFA is not closed?

Options

A : Negation

B : Kleene

C : Concatenation

D : None of the mentioned

Click to view Correct Answer

Exam Quiz App on Google Play

Previous || Next

Applications of DFA more questions

It is less complex to prove the closure properties over....

John is asked to make an automaton which accepts a....

Let N (Q, ?, ?, q0, A) be the NFA....

Statement 1: NFA computes the string along parallel paths.^ Statement....

There exists an initial state, 17 transition states, 7 final....

Which of the following do we use to form an....

Which of the following is an application of Finite Automaton?

Which of the following options is correct for the given....

L1= {w | w does not contain the string tr....

Left corner parsing methof uses which of the following?

Ambiguous Grammar more Online Exam Quiz

Robotics - 2

Rule Based System - 2

Semantic Net - 2

Ambiguous Grammar

Applications - Parsers

Applications of NFA

Applications of Pumping Lemma/Pigeonhole principle

CFG-Eliminating Useless Symbols

Deterministic Finite Automata-Introduction and Definition

Finding Patterns in Text,Algebric Laws and Derivatives