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