Your browser does not support JavaScript!
FollowingApe just signed up and they study Marketing Management 📈
CompletePike just signed up and they study Hotel Management 🏨
PunyRoadrunner just signed up and they study Information Technology 👩‍💻
ProminentPigeon just signed up and they study Information Technology 👩‍💻
FaithfulMouse just signed up and they study Information Technology 👩‍💻
DefensiveKingfisher just signed up and they study Hotel Management 🏨
EverydaySloth just signed up and they study Hotel Management 🏨
GeneticGuppy just signed up and they study Real Estate Management 🏘️
FeministFelidae just signed up and they study Information Technology 👩‍💻
IdeologicalCanidae just signed up and they study Management Information System ℹ️

Automata Theory and Formal Language

Showing 1-75 of 283 answers

“C if H” is also the same as saying _______.
  • “If H then ” Correct
  • “If C then H”
  • “If H then C else {}”
  • “If H then C else do nothing”
“If H then ” is also the same as saying _______.
  • “If H then C else do nothing”
  • “If C then H”
  • “If H then C else {}”
  • “C if H” Correct
“Whenever H holds, C follows” can also be said as _______.
  • H → ε and  ε → C
  • H → C Correct
  • C → H
  • ε → H and  C →  ε
{Q, Σ, q0, F, δ, Q × Σ → Q} is…
  • An NFA
  • Either DFA or NFA
  • There is no such tuple Correct
  • A DFA
|-* is the _____ closure of |-
  • transitive and reflexive Correct
|-* is the closure of |-
  • Transitive and Reflexive Correct
A - B will contain elements in?
  • B not in A
  • A not in B Correct
  • Neither A nor B
  • Both A and B
A ⊂ B is read as ________________.
  • A is less than B
  • A is a subset of B
  • B is a subset of A
  • A is a proper subset of B Correct
A 2-Tape Turing Machine ___________________.
  • can infer that recursive languages are closed under union
  • can show that recursive languages are closed under union Correct
  • has two outputs
  • has two inputs
A DFA is defined ____________________.
  • as Department of Finite Automaton
  • by a 5-tuple which is {Q, Σ, q0, F, δ} Correct
  • by a 6-tuple which is {Q, Σ, q0, F, δ, Q × Σ → Q}
  • as Department of Foreign Affairs
A DPDA is a PDA in which
  • No state p has two outgoing transitions Correct
A DPDA is a PDA in which.
  • No state p has two outgoing transitions Correct
A good regular expression for any valid real number using engineering notation is ______________.
  • [0-9]+[0-9]*[(E|e)[0-9]+] Correct
  • [0-9]*
  • [0-9]+[0-9]*[(E|e|∈)[0-9]+]
  • [0-9]+
A good regular expression of a person's name is ______________.
  • None of the given choices
  • [A-Z][a-z]+
  • [A-Z][a-z]?
  • [A-Z][a-z]* Correct
A nested if-then statement is one of these:
  • If w then x if y then z
  • If w if x then y then z
  • If w then if x then y else z Correct
  • All of the choices are examples of nestedness
A PDA is already in its accept state if:
  • and only if it is both in the final state and the stack is empty
  • none of the given choices
  • it is either in the final state or the stack is empty Correct
  • it has no more input to process
A PDA machine configuration (p, w, y) can be correctly represented as.
  • Current state, Unprocessed input, Stack content Correct
A PDA machine configuration (p, w, y) can be ly represented as ____________
  • current state, unprocessed input, stack content Correct
A pushdown automata can be regarded as:
  • a ε-NFA with a stack Correct
  • a DFA with a FILO queue
  • a NFA with a stack
  • a DFA with FIFO queue
A symbol X is reachable _________________________.
  • if S → aXβ
  • if X →* w, for some w ∈ Σ
  • if X → w, for some w ∈ Σ
  • if S →* aXβ Correct
Search
All courses