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