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