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 ℹ️
AMA University Answers
Earn money Login Register

Automata Theory and Formal Language

Showing 1-75 of 283 answers

__ is a finite set of states.
  • Q Correct
343
__ is a finite set of symbols called the alphabet.
  • Σ Correct
337
__ is a set of final state/states of Q (F ⊆ Q).
  • F Correct
280
__ is the initial state from where any input is processed (q0 ∈ Q).
  • q0 Correct
409
__ is the transition function where δ: Q × Σ → Q.
  • δ Correct
438
______ is used to derive a string using the production rules of a grammar.
  • Parsing Correct
166
“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”
341
“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
202
“Whenever H holds, C follows” can also be said as _______.
  • H → ε and  ε → C
  • H → C Correct
  • C → H
  • ε → H and  C →  ε
209
{Q, Σ, q0, F, δ, Q × Σ → Q} is…
  • An NFA
  • Either DFA or NFA
  • There is no such tuple Correct
  • A DFA
310
* Starts from tree leaves. It proceeds upward to the root which is the starting symbol S
  • bottom-up approach Correct
160
* Starts from tree leaves. It proceeds upward to the root which is the starting symbol S.
  • Bottom-Up Approach Correct
365
* Starts with the starting symbol S. It goes down to tree leaves using productions.
  • Top-Down Approach Correct
363
|-* is the _____ closure of |-
  • transitive and reflexive Correct
117
|-* is the closure of |-
  • Transitive and Reflexive Correct
70
A _____ may or may not read an input symbol, but it has to read the top of the stack in every transition
  • PDA Correct
410
A __________ of a derivation is a tree in which each internal node is labeled with a nonterminal.
  • parse tree Correct
233
A - B will contain elements in?
  • B not in A
  • A not in B Correct
  • Neither A nor B
  • Both A and B
345
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
376
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
183
A compact textual representation of a set of strings representing a language.
  • Regular Expressions Correct
319
A conceptual design for a machine consisting of a Mill, Store, Printer, and Readers.
  • Analytic Engine Correct
373
A DFA can remember a finite amount of information, but a ____ can remember an infinite amount of information.
  • PDA Correct
328
A DFA can remember a finite amount of information, but a can remember an infinite amount of information.
  • PDA Correct
324
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
312
A DFA is represented by digraphs called.
  • State Diagram Correct
402
1
A DPDA is a PDA in which
  • No state p has two outgoing transitions Correct
74
A DPDA is a PDA in which.
  • No state p has two outgoing transitions Correct
209
A Finite Automaton with null moves (FA-ε) does transit not only after giving input from the alphabet set but also without any input symbol. This transition without input is called a
  • Null Move Correct
213
A Finite Automaton with null moves (FA-ε) does transit not only after giving input from the alphabet set but also without any input symbol. This transition without input is called a.
  • Null Move Correct
96
A finite number of states
  • Q Correct
358
A finite number of states.
  • Q Correct
188
A finite set of input symbols.
  • Σ Correct
270
A finite set of states
  • Q Correct
346
A finite set of states.
  • Q Correct
55
A formal language is a set of strings, each string composed of symbols from a finite set called
  • alphabet Correct
411
A formal language is a set of strings, each string composed of symbols from a finite set called.
  • Alphabet Correct
304
A general purpose, programmable, information processor with input and output.
  • computer Correct
323
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]+
304
A good regular expression for any valid whole number is ______________.
  • [0-9]*
  • [0-9]*[0-9]*
  • [0-9]+ Correct
  • [0-9]+[0-9]*
345
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
171
A grammar G is ambiguous if there is a word w Î L(G) having are least two different parse trees.
  • TRUE Correct
279
A language accepted by Deterministic Push down automata is closed under which of the following?
  • complement Correct
36
A language is regular if and only if.
  • Accepted by DFA Correct
206
A may or may not read an input symbol, but it has to read the top of the stack in every transition
  • PDA Correct
214
A may or may not read an input symbol, but it has to read the top of the stack in every transition.
  • PDA Correct
295
A Moore machine can be described by a tuple.
  • 6 Correct
334
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
248
A new symbol is added at the top.
  • Push Correct
208
A of a derivation is a tree in which each internal node is labeled with a nonterminal.
  • Parse Tree Correct
457
A parsing that starts from the top with the start-symbol and derives a string using a parsetree.
  • top-down parser Correct
323
A PDA accepts a string when, after reading the entire string, the PDA is in a final state.
  • TRUE Correct
366
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
348
A PDA machine configuration (p, w, y) can be correctly represented as ____________ .
  • current state, unprocessed input, stack content Correct
336
A PDA machine configuration (p, w, y) can be correctly represented as.
  • Current state, Unprocessed input, Stack content Correct
323
A PDA machine configuration (p, w, y) can be ly represented as ____________
  • current state, unprocessed input, stack content Correct
11
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
264
A pushdown automaton is a way to implement a context-free grammar in a similar way to design DFA for a regular grammar.
  • TRUE Correct
336
A regular expression consisting of a finite set of grammar rules is a quadruple.
  • FALSE Correct
348
A right-most derivation of a sentential form is one in which rules transforming the are always applied.
  • Context Correct
257
A set has n elements, then the number of elements in its power set is?
  • 2n
  • 2 ^ n Correct
  • None of the choices
  • 2n-1
283
A set of accepting states (F ∈ Q)
  • F Correct
420
A set of accepting states (F ∈ Q).
  • F Correct
106
A set of final state/states of Q (F⊆Q).
  • F Correct
357
A set of rules, P: N → (N U T)*, it does have any right context or left context.
  • P Correct
249
A set of strings of a's and b's of any length including the null string. So L= { ε, a, b, aa , ab , bb , ba, aaa.......}, the regular
  • (a+b)* Correct
410
A set of strings of a's and b's of any length including the null string. So L= { ε, a, b, aa , ab , bb , ba, aaa.......}, the regular expression is.
  • (a+b)* Correct
202
A set of terminals where N ∩ T = NULL.
  • T Correct
279
A set on non-terminal symbols.
  • S & A Correct
396
A stack symbols
  • Σ Correct
302
A string is accepted by a, iff the DFA/NDFA starting at the initial state ends in an after reading the string.
  • NDFA Correct
293
A sub-tree of a derivation tree/parse tree such that either all of its children are in the sub-tree or none of them are in the
  • Partial Derivation Tree, Sub-Tree Correct
429
A symbol X is reachable _________________________.
  • if S → aXβ
  • if X →* w, for some w ∈ Σ
  • if X → w, for some w ∈ Σ
  • if S →* aXβ Correct
205
A transition function δ : Q × (Σ ∪ {ε}) → 2Q.
  • δ Correct
353
A transition function: Q × (Σ∪{ε}) × S × Q × S*
  • δ Correct
180
Search
Need to search and CTRL+F on AMA modules?
All courses