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