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