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