Ctrl + F is the shortcut in your browser or operating system that allows you to find words or questions quickly.
Ctrl + Tab to move to the next tab to the right and Ctrl + Shift + Tab to move to the next tab to the left.
On a phone or tablet, tap the menu icon in the upper-right corner of the window; Select "Find in Page" to search a question.
Share UsSharing is Caring
It's the biggest motivation to help us to make the site better by sharing this to your friends or classmates.
Delves into the study of abstract machines and their applications in understanding and processing formal languages, such as programming languages and compilers.
The complement of an infinite language is necessarily finite.
__ is a finite set of states.
A stack symbols
Some graphs contain cycles.
The minimum number of states required to recognize an octal number divisible by 3 are/is.
__ is the initial state from where any input is processed (q0 ∈ Q).
The basic model of a Turing machine consists of _______ and _______ , in which the finite control has finite set of states and the transition between the states.
The body of a production in CFG is composed of:
An indirect way of building a CFG is to _____________
A string is accepted by a, iff the DFA/NDFA starting at the initial state ends in an after reading the string.
A nested if-then statement is one of these:
Labeled by a terminal symbol or ε.
The initial stack top symbol (I ∈ S)
Turing hypothesis believed that a function is said to be computable if and only if it can be computed by a Turing machine.
A pushdown automaton is a way to implement a context-free grammar in a similar way to design DFA for a regular grammar.
The cardinality of the union of two disjoint sets is less than the sum of the cardinality of the given sets.
A DFA can remember a finite amount of information, but a ____ can remember an infinite amount of information.
A grammar G is ambiguous if there is a word w Î L(G) having are least two different parse trees.
Start symbol, S ∈ N
If we can successfully and correctly stimulate a TM with storage by two standard TMs, then ______________________.
A finite number of states
The start symbol.
The _____ of two sets A and B is the set containing those elements which are elements of A or elements of B.
* Starts with the starting symbol S. It goes down to tree leaves using productions.
Elimination of productions and symbols is called simplification of CFGs. Simplification essentially comprises of the following steps:
Connected graphs have components.
Is used to derive a string using the production rules of a grammar.
All relations are functions
Which among the following is not a part of the Context free grammar tuple?
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
Increasing coverage, or recall.
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.
__ is a finite set of symbols called the alphabet.
A pushdown automata can be regarded as:
The relationship between recursive and recursively enumerable languages is ________________.
The string abe is accepted by this regular expression.
A set of accepting states (F ∈ Q)
The transition a Push down automaton makes it additionally dependent upon the _____.
Set of final or accepting states
Labeled by a non-terminal symbol.
Circuits in graphs are always simple paths.
Is a set of final state/states of Q (F ⊆ Q).
A 2-Tape Turing Machine ___________________.
The unconsumed input.
The first counting machine developed 5000 years ago in the Middle East.
An initial state q0 ∈ Q.
The initial stack top symbol (I ∈ S).
In _____ Allan M. Turing proposed the Turing machine as a model of "any possible computation".
The stack contents.
An algorithms to shampoo your hair.
IT generate recursively enumerable languages. The productions have no restrictions and phase structure grammar including all formal grammars.
The CFG "S → (S) | SS | ε" accepts:
An order rooted tree that graphically represents the semantic information a string derived from a context-free grammar.
How many sets belong to the power set of A = {a,b,c,d}?
The theory of formal languages finds its applicability extensively in the fields of Computer Science. gave a mathematical model of grammar in which is effective for writing computer languages.
Context-free grammars are more expressive than finite automata; if a language L is by a finite automata then L can be by a context-free grammar.
Identify the modeling recognition of the word "then"
Starting state
Let w = 100011, is w a member of a language of string with equal number of 0s and 1s?
Finite set of states.
Context-free grammars are more expressive than finite automata; if a language L is _____ by a finite automata then L can be _______ by a context-free grammar.
A DFA is represented by digraphs called.
A PDA is already in its accept state if:
Which one is the answer?
How many rational and irrational numbers are possible between 0 and 1?
Finite Automata all regular languages and only regular languages.
Who is the father of modern computer science?
In the Chomsky Hierarchy:
The transition a Push down automaton makes it additionally dependent upon the
A conceptual design for a machine consisting of a Mill, Store, Printer, and Readers.
In mathematical notation, the symbol → means...
Which of the following statements is true about NPDA, DPDA, and RL?
According to what concept is CFL a superset of RL?
A set has n elements, then the number of elements in its power set is?
“C if H” is also the same as saying _______.
NFA means:
What can be said about undecidable problems?
All trees contain loops.
If L1 and L2 are regular sets then intersection of these two will be
Which of the following will not be accepted by the following DFA?
What concept did Alan Turing introduce?
What is an undecidable problem?
Production Rule: aAb->agb belongs to which of the following category?
Unconsumed input.
A ⊂ B is read as ________________.
Having the initial state as a final state, give the deterministic finite state automaton that accepts the regular expression.
Number of states require to accept string ends with 10.
Set of all tape symbols
The following are phases of C++ Programs except
A DFA is defined ____________________.
In Allan M. Turing proposed the Turing machine as a model of "any possible computation".
A formal language is a set of strings, each string composed of symbols from a finite set called.
A symbol X is reachable _________________________.
Which of the following is a not a part of 5-tuple finite automata?
The top symbol is read and removed.
It starts from the bottom with the string and comes to the start symbol using a parse tree.
For every pair of regular expressions R and S, the languages denoted by R(SR)* and (RS)*R are the same.
A _____ may or may not read an input symbol, but it has to read the top of the stack in every transition
An English like abbreviations representing elementary computer operations.
All functions are relations
A transition function: Q × (Σ∪{ε}) × S × Q × S*
What is an ε-NFA?
A good regular expression for any valid whole number is ______________.
The entity which generate Language is termed as:
A formal language is a set of strings, each string composed of symbols from a finite set called
A DPDA is a PDA in which.
The language L contains all strings over the alphabet {a,b} that begin with and end with
A PDA accepts a string when, after reading the entire string, the PDA is in a final state.
A right-most derivation of a sentential form is one in which rules transforming the are always applied.
Non-terminal symbols
Checking whether there is a matching parenthesis in a computer code can be done by a ______________.
If Σ2 is {00, 01, 10, 11}, then Σ =
A of a derivation is a tree in which each internal node is labeled with a nonterminal.
IT generate recursively enumerable languages. The productions have no restrictions and phase structure grammar including all formal grammars. They generate the languages that are recognized by a Turing machine.
Which of the following ways can be done to simplify a CFG?
For every CFL, G, there exists a PDA M such that L(G) = L(M) and vice versa.
A transition function: Q × (Σ∪{ε}) × S × Q × S*.
What is a language?
An example string w of a language L characterized by equal number of As and Bs is _______________.
In words, H → C means…
If a problem can be shown that it belongs to the class of recursively enumerable languages then ______________________.
An ε-NFA with a stack is also regarded as:
If A = {5,6,7} and B = {7,8,9} then A U B is equal to:
Increasing accuracy, or precision
Which among the following is the correct option for the given grammar? G->X111|G1,X->X0|00.
A good regular expression of a person's name is ______________.
A finite set of input symbols.
If A →* ε, then we can say that:
Global Positioning System (GPS) calculates latitude and longitude from satellite signals.
Computer science has roots in two fields :
Finite set of states
__ is a set of final state/states of Q (F ⊆ Q).
What is a grammar?
In ____ Allan M. Turing proposed the Turing machine as a model of "any possible computation".
An automaton that produces outputs based on current input and/or previous state is called.
It process information in their efforts to eat, survive, and reproduce.
It generate context-free languages. The productions must be in the form A → γ
______ is used to derive a string using the production rules of a grammar.
A transition function δ : Q × (Σ ∪ {ε}) → 2Q.
For bottom-up parsing, a PDA has the following four types of transitions:
There are 5 tuples in finite state machine.
Who is the father of modern computer?
What are strings?
A DFA can remember a finite amount of information, but a can remember an infinite amount of information.
Transition function
Terminal symbols
If R = {(1,1),(2,3),(4,5)}, then domain of the function is?
If we can successfully and ly stimulate a TM with storage by two standard TMs, then ______________________
* Starts from tree leaves. It proceeds upward to the root which is the starting symbol S.
If L is recursively enumerable then ________________.
The tape head is positioned at one of the tape cells for scanning the input symbol from the input tape and initially the tape head points at the left most cell of the input tape.
The empty set is always a subset of any set.
A finite number of states.
It starts from the top with the start-symbol and derives a string using a parse tree.
The of a Turing machine depends on the current state of finite control and the tape symbol present in the input tape.
A language is regular if and only if.
JASON can generally be parsed by ______________.
It is a unary operator on a set of symbols or strings, that gives the infinite set of all possible strings of all possible lengths.
If A has m elements and B has n elements, then A x B has elements?
The first mechanical calculator using gears for calculation developed in 1642.
What can be said about CFLs?
{Q, Σ, q0, F, δ, Q × Σ → Q} is…
For the given Regular expression, the minimum number of terminals required to derive its grammar (011+1)*(01)* is
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
Recursive : TM that always halt = ________________ : TM that may or may not halt
A general purpose, programmable, information processor with input and output.
Let the class of language accepted by finite state machine be L1 and the class of languages represented by regular expressions be L2 then.
For every CFL, G, there exists a PDA M such that L(G) = L(M) and vice versa
A __________ of a derivation is a tree in which each internal node is labeled with a nonterminal.
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.
The stack contents
The stack content
The entity which generate Language is termed as regular languages.
The initial state (q0 ∈ Q)
For a regular expression 'a', we can construct the following FA:
What kind of languages does a TM decide?
Language may be derived from other strings using the productions in a grammar.
challenged the mathematical community to find an infallible, mechanical method for constructing and checking truth of mathematical statements.
are parameterized statement, they are true or false depending on the values of their parameters.
A finite set of states
According to the 5-tuple representation i.e. FA= {Q, ∑, δ, q, F} Statement 1: q ϵ Q'; Statement 2: FϵQ
If A = {0,2) and B = {1,3), then Cartesian product is?
“Whenever H holds, C follows” can also be said as _______.
Any production rule in the form A → B where A, B ∈ Non-terminal is called unit production.
Number of final state require to accept in minimal finite automata.
The intersection of sets A and B is expressed as _________________.
One of the first programmable electronic computers in 1945.
Empty string
A set of final state/states of Q (F⊆Q).
The difference between regular expressions and finite automata is _____________.
Noam Chomsky gave a mathematical model in which is effective for writing computer languages.
A may or may not read an input symbol, but it has to read the top of the stack in every transition.
Finite set of input alphabets
What cannot be said about automata theory?
Set of final or accepting states.
A set on non-terminal symbols.
Context Free Languages is closed under intersection.
A PDA machine configuration (p, w, y) can be correctly represented as.
Unconsumed input
A new symbol is added at the top.
Given that the language L = {ε}, is L empty?
The algebraic law of regular expression described by φE = φ = Eφ is _______________.
Finite set of input alphabets.
What can not be said about CFLs?
What is the final result after converting the following NFA-ε to NFA without Null move.
The commutativity property of set operations states that the union of any set with same set is the set itself.
Any set that represents the value of the Regular Expression is called a Property set.
__ is the transition function where δ: Q × Σ → Q.
What is a Universal TM?
A compact textual representation of a set of strings representing a language.
Labeled by the start symbol.
Which of the following statement is false in context of tree terminology?
|-* is the closure of |-
Are ambiguous grammar context free?
It refers to the measure of the number of times the tape moves when the machine is initialized for some input symbols and the space complexity is the number of cells of the tape written.
Noam Chomsky gave a mathematical model in ___ which is effective for writing computer languages.
Z2 uses electricity to convey letters and transmit information quickly in 1844.
Empty set is a/an ________________.
|-* is the _____ closure of |-
A set of terminals where N ∩ T = NULL.
The symbol used for the empty string is ____________.
The __________ of a Turing machine depends on the current state of finite control and the tape symbol present in the input tape.
A set of accepting states (F ∈ Q).
A Moore machine can be described by a tuple.
A - B will contain elements in?
Given the language L = {ε}, is L empty?
T generate recursively enumerable languages. The productions have no restrictions and phase structure grammar including all formal grammars.
A good regular expression for any valid real number using engineering notation is ______________.
The string "0000111" is accepted by _____________.
Every set is a / an ________________ of itself.
The algebraic law of regular expression described by E + E = E is _____________.
S → aAb, aA →aaAb, A→ε
The string acde is accepted by this regular expression.
A PDA machine configuration (p, w, y) can be ly represented as ____________
* Starts from tree leaves. It proceeds upward to the root which is the starting symbol S
Which of the following statements are correct for a concept called inherent ambiguity in CFL?
An initial state q0 ∈ Q
Is a finite set of states.
A may or may not read an input symbol, but it has to read the top of the stack in every transition
A finite set of states.
Is the initial state from where any input is processed (q0 ∈ Q).
A PDA machine configuration (p, w, y) can be correctly represented as ____________ .
If A = {3, 4, 6, 8} and
If L1 and L2 are regular sets then intersection of these two will be.
Increasing accuracy, or precision.
“If H then ” is also the same as saying _______.
Leibniz introduced binary notation of calculation.
Computers are general purpose because they can perform many different tasks.
The unconsumed input
Blank symbol
A regular expression consisting of a finite set of grammar rules is a quadruple.
The PDA has infinite memory and access in _____ order and the finite automata has ____ memory.
Is the transition function where δ: Q × Σ → Q.
A set of rules, P: N → (N U T)*, it does have any right context or left context.
If R ={(1,1),(2,3),(4,5)}, then the Range of the function is?
The string aaaabbbccaaad is accepted by this regular expression.
The number of elements in the set for the Language L={xϵ(∑r) *|length if x is at most 2} and ∑={0,1} is
A parsing that starts from the top with the start-symbol and derives a string using a parsetree.
Any production rule in the form A → B where A, B ∈ Non-terminal is called.
Regular expression Φ* is equivalent to
Which among the following is the option for the given grammar? G->X111|G1,X->X0|00
Regular sets are closed under union,concatenation and kleene closure.
Is a finite set of symbols called the alphabet.
A language accepted by Deterministic Push down automata is closed under which of the following?
The difference between DFA and NFA
The power set of a given set does not contain the set itself.
Regular expression Φ* is equivalent to.
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
Which of the following statements are for a concept called inherent ambiguity in CFL?
Every context free grammar can be transformed into an equvalent non deterministic push down automata.
Context-free grammars are more expressive than finite automata; if a language L is by a finite automata then L can be blank by a context-free grammar.
Which of the following Set Operations produces the set that contains everything that is in Set A and in Set B?
Is to be applied to show that certain languages are not regular. It should never be used to show a language is regular.
What is automata theory?
NP-Hard problems are problems that are...
Given the productions S → αXβ, X → a, ___________________.
The union of sets A and B is expressed as?
A' will contain how many elements from the original set A?
The recursive inference procedure determines that string w is in the language of the variable A, A being the starting variable.
Which among the following cannot be accepted by a regular grammar?
Noam Chomsky gave a mathematical model in _______ which is effective for writing computer languages.
An alphabet is any finite set of symbols.
A DPDA is a PDA in which
To keep up this site, we need your assistance. A little gift will help us alot.
Donate- The more you give the more you receive.
Related SubjectTheoretical Foundations of Nursing
Accounting Research Methods
State Fair: Discover the Best of U.S. Fairs
Biden's Final Full Day as President
Germany Energy Policy
Middle School Education
English
English as a Second Language
Teaching English in the Elementary Grades: Language Arts
Technical Scientific and Business English
Reading and Writing Skills
Shopee Cashback Voucher
Temu $0 Shipping Fee
Amazon 75% Off Discounts