notes, Theory of Computation

write short notes on decidable and solvable problem
Posted Date: 3/22/2013 7:33:45 AM | Location :







Related Discussions:- notes, Assignment Help, Ask Question on notes, Get Answer, Expert's Help, notes Discussions

Write discussion on notes
Your posts are moderated
Related Questions
For example, the question of whether a given regular language is positive (does not include the empty string) is algorithmically decidable. "Positiveness Problem". Note that

Differentiate between DFA and NFA. Convert the following Regular Expression into DFA. (0+1)*(01*+10*)*(0+1)*. Also write a regular grammar for this DFA.

Define the following concept with an example: a.    Ambiguity in CFG b.    Push-Down Automata c.    Turing Machine

draw pda for l={an,bm,an/m,n>=0} n is in superscript

Since the signi?cance of the states represented by the nodes of these transition graphs is arbitrary, we will allow ourselves to use any ?nite set (such as {A,B,C,D,E, F,G,H} or ev


how to find whether the language is cfl or not?

what are the advantages and disadvantages of wearable computers?

All that distinguishes the de?nition of the class of Regular languages from that of the class of Star-Free languages is that the former is closed under Kleene closure while the lat

The initial ID of the automaton given in Figure 3, running on input ‘aabbba' is (A, aabbba) The ID after the ?rst three transitions of the computation is (F, bba) The p