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