Start Discovering Solved Questions and Your Course Assignments
TextBooks Included
Active Tutors
Asked Questions
Answered Questions
the universe of strings is a very useful medium for the representation of information as long as there exists a function that provides the
a finite nonempty ordered set will be called an alphabet if its elements are symbols or characters a finite sequence of symbols from a given alphabet
computations are deliberate for processing information computability theory was discovered in the 1930s and extended in the 1950s and 1960s its
find the regular grammar for the following regular expression
state amp prove pumping lemma for regular set show that for the language lap p is a prime is not
distinguish between mealy and moore machine construct a mealy machine that can output even or odd according to the total no of 1s encountered is even
define the following concept with an examplea ambiguity in cfgb push-down automatac turing
differentiate between dfa and nfa convert the following regular expression into dfa01011001also write a regular grammar for this
suppose g n sigma p s is a reduced grammar we can certainly reduce g if we havent already our algorithm is as follows1 define maxrhsg to be the
a context free grammar g n sigma p s is in binary form if for all productionsa we have alpha le 2 in addition we say that g is in chomsky
normal forms are important because they give us a standard way of rewriting and allow us to compare two apparently different grammars g1 and g2
a let n be the pumping lemma constant then if l is regular pl implies that s can be decomposed into xyz y gt 0 xy len such that xy i z is in l for
let l1 and l2 be cgf we show that l1 cap l2 is cfg toolet m1 be a decider for l1 and m2 be a decider for l2 consider a 2-tape tm mon input x1 copy x
let there l1 and l2 we show that l1 cap l2 is cfg let m1 be a decider for l1 and m2 be a decider for l2 consider a 2-tape tm mon input x1 copy x on
you are required to design a system that controls the speed of a fans rotation the speed at which the fan rotates is determined by the ambient
let 01 design a turing machine that accepts l0m 1m 2m show using id that a string from the language is accepted amp if not rejected
s-gt0a01b1bb a-gtc b-gtsa c-gtsnull find useless
find a regular expression for the regular language lw w is decimal notation for an integer that is a multiple of
let gvtsp where vababs tabs the start symbol and ps-gtaba a-gtbb b-gtabab-gtb 1show the derivation sentence for the string ababba 2 find a
generate 100 random numbers with the exponential distribution lambda50what is the probability that the largest of them is less than
your company has 25 licenses for a computer program but you discover that it has been copied onto 80 computers you informed your supervisor but heshe
explain theory of computationoverview of dfanfa cfg pda turing machine regular language context free language pumping lemma context sensitive
automata and compiler1 25 marks let n be the last two digits of your student number. design a finite automaton that accepts the language of strings
Suppose A is an n × n matrix and let p be an integer in the range 2 : n and such that A(p : n, 1 : p-1) is an all-zero matrix. Suppose lu (LU decomposition) is applied to A. Show that the r
The logical operator "↔" is read "if and only if." P ↔ Q is defined as being equivalent to (P → Q) ˆ(Q →P). Based on this definition, show that P ↔ Q is logically equival