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