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