资源描述:
《theory of automata formal languages and computation s.p.eugene xavier ( new age international 2005 pp.360)外语英文电子书》由会员上传分享,免费在线阅读,更多相关内容在教育资源-天天文库。
1、Copyright©2005NewAgeInternational(P)Ltd.,PublishersPublishedbyNewAgeInternational(P)Ltd.,PublishersAllrightsreserved.Nopartofthisebookmaybereproducedinanyform,byphotostat,microfilm,xerography,oranyothermeans,orincorporatedintoanyinformationretrievalsystem,electronicormechanica
2、l,withoutthewrittenpermissionofthepublisher.Allinquiriesshouldbeemailedtorights@newagepublishers.comISBN(10):81-224-2334-5ISBN(13):978-81-224-2334-1PUBLISHINGFORONEWORLDNEWAGEINTERNATIONAL(P)LIMITED,PUBLISHERS4835/24,AnsariRoad,Daryaganj,NewDelhi-110002Visitusatwww.newagepubli
3、shers.comTHISPAGEISBLANKPrefaceThisbookdealswithafascinatingandimportantsubjectwhichhasthefundamentalsofcomputerhardware,softwareandsomeoftheirapplications.Thisbookisintendedasanintroductorygraduatetextincomputersciencetheory.Ihavetakencaretopresentthematerialveryclearlyandint
4、erestingly.Asanintroductorysubjecttocomputerscience,thisbookhasbeenwrittenwithmajorstressonworkedexamples.Chapter0coversthebasicsrequiredforthissubjectviz.,sets,relations,functions,graphs,trees,languages,andfundamentalprooftechniques.Chapter1dealswiththedifferentaspectsofDeter
5、ministicFiniteAutomata(DFA)andNon-DeterministicFiniteAutomata(NFA).AbriefintroductiontopumpinglemmaandsometheoremsrelatingtoRegularSetshavealsobeengiven.Chapter2coverstheconceptsrelatingtocontextfreegrammarviz.,derivationtrees,parsing,ambiguity,andnormalforms.Chapter3dealswith
6、PushdownAutomataandtheirrelationtoContext-FreeGrammarwithsomeintroductiontodecisionalgorithms.Chapter4dealswiththeTuringMachinemodelandthevariationsofTuringMachineswithintroductiontoChurch-TuringThesisandtheconceptofundecidability.Chapter5explainstheconceptsviz.,regulargrammar
7、s,unrestrictedgrammarsandChomskyhierarchyoflanguages.Chapter6dealswiththedifferentaspectsofcomputabilitywithanintroductiontoformalsystems,recursivefunctions,primitiverecursivefunctions,andrecursion.Chapter7coversthevariousaspectofcomplexitytheorysuchaspolynomialtimealgorithms,
8、non-polynomialtimealgorithmclassPandNPproblems.Chapter8covers