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