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