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