Given an arbitrary non-deterministic finite automaton (NFA) with N states, the maximum number of states in an equivalent minimized DFA is at least?(a) N^2(b) 2^N(c) 2N(d) N!

Given an arbitrary non-deterministic finite automaton (NFA) with N sta

1.	Given an arbitrary non-deterministic finite automaton (NFA) with N states, the maximum number of states in an equivalent minimized DFA is at least?(a) N^2(b) 2^N(c) 2N(d) N!
Answer» Correct option is (c) 2N For explanation I would say: If the NFA has n states, the resulting DFA may have up to 2n states, an exponentially larger number, which sometimes makes the construction impractical for large NFAs.

Discussion

No Comment Found

Related InterviewSolutions

Let the class of language accepted by finite state machine be L1 and the class of languages represented by regular expressions be L2 then?(a) L1=L2(c) L1 U L2 = .*(d) L1=L2
Dynamic linking can cause security concerns because ______________(a) Security is dynamic(b) None of the mentioned(c) Security is dynamic & Cryptographic procedures are not available for dynamic linking(d) Cryptographic procedures are not available for dynamic linking
The segment base is specified using the register named is?(a) ORG instructions(b) TITLE instruction(c) ASSUME instruction(d) SEGMENT instruction
The process manager has to keep track of ___________(a) Status of each program(b) Information to a programmer using the system(c) Status of each program & Information to a programmer using the system(d) None of the mentioned
Generation of intermediate code based on a abstract machine model is useful in compilers because ____________(a) Implementation of lexical analysis and syntax analysis is made easier(b) Writing for intermediate code generation(c) Portability of the front end of the compiler(d) None of the mentioned
Assembler is a program that _________(a) Puts programs into memory and executes them(b) Translates the assembly language into machine language(c) Writes in high level language and produces an object program(d) None of the mentioned
The specific task storage manager performs ____________(a) Allocation/ deal location of programs(b) Protection of storage area assigned to the program(c) Allocation/ deal location of programs & protection of storage area assigned to the program(d) None of the mentioned
_________ register keeps track of the instructions stored in program stored in memory.(a) AR (Address Register)(b) XR (Index Register)(c) PC (Program Counter)(d) AC (Accumulator)
A simple two-pass assembler does which of the following in the first pass?(a) It allocates space for the literals(b) Calculates total length of the program(c) Symbol table is built for the symbols and their value(d) All of the mentioned
Which of the following is a two-dimensional array?(a) array array[20][20](b) int array[20][20](c) int array[20, 20](d) char array[20]

Given an arbitrary non-deterministic finite automaton (NFA) with N states, the maximum number of states in an equivalent minimized DFA is at least?(a) N^2(b) 2^N(c) 2N(d) N!

Discussion

No Comment Found

Related InterviewSolutions

Reply to Comment