Welcome to Scribd, the world's digital library. Read, publish, and share books and documents. See more
Standard view
Full view
of .
Save to My Library
Look up keyword
Like this
0 of .
Results for:
No results containing your search query
P. 1
study note of theory of computation

study note of theory of computation

Ratings: (0)|Views: 3,136|Likes:
Published by arik_cj

More info:

Published by: arik_cj on Dec 03, 2009
Copyright:Attribution Non-commercial


Read on Scribd mobile: iPhone, iPad and Android.
download as PDF, TXT or read online from Scribd
See more
See less





Theory of Computation
Arik Chenarik.cj@gmail.com
Automata and Language
Turing machineM=(Q,E,A,T,q0,qa,qr)Q: a set of stateE: input alphabet set.A: tape alphabet set, large than E.T: transition functionq0: start state qa: accept stateqr:reject stateGrammar G=(V,T,P,S)V is the alphabet;T is all the terminalS is a special non-terminal startsymbole.g. cAd->aABdR.E.recursive is a subset of R.E.if L is R.E, ~L may not R.E.If L is recursive, then ~L is also.L is recursive iff both ~L and L areR.EPDAP=(Q,E,A,T,q0,F,)A: the stack alphabetT:
transition relation
((state, tape,stack), (state', stack))q0: the initial stateF: a set of final states,
(q, e, e)
CFGG=(V, T, P, S)P is the finite set of production.e.g. A->ABCFLsome context free language is notregular ().FAA={Q,E,T,q0,F}In DFA, T maps input
one state
In NFA, T maps input
a set of states
regular expressionregular languageall regular language are contextfree language.
Relation of Languages

Activity (24)

You've already reviewed this. Edit your review.
1 hundred reads
1 thousand reads
Mary Jansi liked this
Rajesh Kumar liked this
Fajar Ibnu liked this
d280299 liked this
asong_soekamti liked this
athirai liked this
sun00 liked this
jenson liked this

You're Reading a Free Preview

/*********** DO NOT ALTER ANYTHING BELOW THIS LINE ! ************/ var s_code=s.t();if(s_code)document.write(s_code)//-->