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