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