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