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