A PC not connected to a network is equivalent to

Related MCQs

• In which of the stated below is the following statement true? “For every non-deterministic machine M1, there exists as equivalent deterministic machine M2 recognizing the same language.”
• Given an arbitrary non-deterministic finite automaton NFA with N states, the maximum number of states in an equivalent minimized DFA is at least:
• Any given transition graph has an equivalent:
• The minimum state automaton equivalent to the above FSA has the following number of states
• Given a Non-deterministic Finite Automation (NFA) with states p and r as initial and final states respectively and transition table as given below: A B P - Q q R S r R S s R S The minimum number of states required in Deterministic Finite Automation (DFA) equivalent to NFA is
• Which of the following statements is/are FALSE? (1) For every non-deterministic Turing machine, there exists an equivalent deterministic Turing machine. (2) Turing recognizable languages are closed under union and complementation. (3) Turing decidable languages are closed under intersection and complementation (4) Turing recognizable languages are closed under union and intersection.
• If G is a simple connected 3-regular planar graph where every region is bounded by exactly 3 edges, then the edges of G is
• If G is a connected planar graph of v vertices e edges and r regions then
• If G is a simple connected 3-regular planar graph where every region is bounded by exactly 3 edges, then the edges of G is
• Let L1 be a recursive language. Let L2 and L3 be languages that are recursively enumerable but not recursive. Which of the following statements is not necessarily true?