Price Range
Rs. 10.00 - Rs. 1,000.00
Automata
{"id":10761763464,"title":"Theory Of Computation And Application (Automata Theory, Formal Languages)","handle":"theory-of-computation-and-application","description":"\u003cp\u003e\u003cstrong\u003eAuthor: \u003c\/strong\u003e\u003cspan style=\"color: #0000ff;\"\u003eAnil Kumar Malviya \/ Malabika Datta\u003c\/span\u003e\u003c\/p\u003e\n\u003ch5\u003e\n\u003cstrong\u003e\u003c\/strong\u003e\u003cstrong\u003eFeature:\u003c\/strong\u003e\n\u003c\/h5\u003e\n\u003cul\u003e\n\u003cli\u003e\n\u003cstrong\u003eLanguage:\u003c\/strong\u003e English\u003c\/li\u003e\n\u003cli\u003e\n\u003cstrong\u003eBinding:\u003c\/strong\u003e Paperback\u003c\/li\u003e\n\u003cli\u003e\n\u003cstrong\u003ePublisher:\u003c\/strong\u003e BPB Publications\u003c\/li\u003e\n\u003cli\u003e\n\u003cstrong\u003eISBN:\u003c\/strong\u003e 9788183335287\u003c\/li\u003e\n\u003cli\u003e\n\u003cstrong\u003eEdition:\u003c\/strong\u003e 2015\u003c\/li\u003e\n\u003cli\u003e\n\u003cstrong\u003ePages: \u003c\/strong\u003e338\u003c\/li\u003e\n\u003cli\u003e\n\u003cstrong\u003eDimension:\u003c\/strong\u003e 23 X 15.5 X 1.5 cm\u003c\/li\u003e\n\u003c\/ul\u003e\n\u003ch5\u003e\u003cstrong\u003eDescription: \u003c\/strong\u003e\u003c\/h5\u003e\n\u003cp\u003e\u003cspan\u003eThis text book is designed for the first course in Theory of Computation \u0026amp; Application (Automata Theory and Formal Languages) for the students of B.Tech. (CS\/IT) and Master of Computer Applications (MCA) programs of Uttar Pradesh Technical University (UPTU), Lucknow, as well as other Indian Universities. At the end of each chapter a summary for quick revision of concepts and an exercise consisting of objective questions, review questions and programming problems have been given.\u003c\/span\u003e\u003cbr\u003e\u003cbr\u003e\u003c\/p\u003e\n\u003ch4\u003e\u003cspan style=\"color: #000000;\"\u003e\u003cstrong\u003eKey Features:\u003c\/strong\u003e\u003c\/span\u003e\u003c\/h4\u003e\n\u003cul\u003e\n\u003cli\u003e\n\u003cstrong\u003e\u003c\/strong\u003eintroduction and Basic Concepts\u003c\/li\u003e\n\u003cli\u003eFinite Automata\u003c\/li\u003e\n\u003cli\u003eRegular Expressions\u003c\/li\u003e\n\u003cli\u003eRegular and Non- Regular Languages\u003c\/li\u003e\n\u003cli\u003eContext - Free Grammars and Languages\u003c\/li\u003e\n\u003cli\u003ePushdown Automata\u003c\/li\u003e\n\u003cli\u003eProperties Of Context - Free Languages\u003c\/li\u003e\n\u003cli\u003eTuring Machines\u003c\/li\u003e\n\u003cli\u003eRecursively Enumerable Languages and Decidability\u003c\/li\u003e\n\u003cli\u003eModel Question and Examination Papers\u003c\/li\u003e\n\u003c\/ul\u003e\n\u003ch5\u003e\u003cspan style=\"color: #000000;\"\u003e\u003cstrong\u003eTable Of Contents:\u003c\/strong\u003e\u003c\/span\u003e\u003c\/h5\u003e\n\u003cp\u003e\u003cspan style=\"color: #000000;\"\u003eChapter 1. Introduction and Basic Concepts\u003c\/span\u003e\u003c\/p\u003e\n\u003cmeta charset=\"utf-8\"\u003e\n\u003cp\u003e\u003cspan style=\"color: #000000;\"\u003e\u003cspan\u003eChapter 2. Finite Automata\u003c\/span\u003e\u003c\/span\u003e\u003c\/p\u003e\n\u003cmeta charset=\"utf-8\"\u003e\n\u003cp\u003e\u003cspan style=\"color: #000000;\"\u003e\u003cspan\u003eChapter 3. Regular Expressions\u003cbr\u003e\u003c\/span\u003e\u003c\/span\u003e\u003c\/p\u003e\n\u003cmeta charset=\"utf-8\"\u003e\n\u003cp\u003e\u003cspan style=\"color: #000000;\"\u003e\u003cspan\u003eChapter 4. Regular and Non - Regular Languages\u003c\/span\u003e\u003c\/span\u003e\u003c\/p\u003e\n\u003cmeta charset=\"utf-8\"\u003e\n\u003cp\u003e\u003cspan style=\"color: #000000;\"\u003e\u003cspan\u003eChapter 5. Context - Free Grammars and Languages\u003c\/span\u003e\u003c\/span\u003e\u003c\/p\u003e\n\u003cmeta charset=\"utf-8\"\u003e\n\u003cp\u003e\u003cspan style=\"color: #000000;\"\u003e\u003cspan\u003eChapter 6. Pushdown Automata\u003c\/span\u003e\u003c\/span\u003e\u003c\/p\u003e\n\u003cmeta charset=\"utf-8\"\u003e\n\u003cp\u003e\u003cspan style=\"color: #000000;\"\u003e\u003cspan\u003eChapter 7. Properties Of Context - Free Languages\u003cbr\u003e\u003c\/span\u003e\u003c\/span\u003e\u003c\/p\u003e\n\u003cmeta charset=\"utf-8\"\u003e\n\u003cp\u003e\u003cspan style=\"color: #000000;\"\u003e\u003cspan\u003eChapter 8. Turing Machines\u003c\/span\u003e\u003c\/span\u003e\u003c\/p\u003e\n\u003cmeta charset=\"utf-8\"\u003e\n\u003cp\u003e\u003cspan style=\"color: #000000;\"\u003e\u003cspan\u003eChapter 9. Recursively Enumerable Languages and Decidability\u003cbr\u003e\u003c\/span\u003e\u003c\/span\u003e\u003c\/p\u003e\n\u003cp\u003e\u003cspan style=\"color: #000000;\"\u003e\u003cspan\u003eReferences\u003c\/span\u003e\u003c\/span\u003e\u003c\/p\u003e\n\u003cp\u003e\u003cspan style=\"color: #000000;\"\u003e\u003cspan\u003eModel Question Papers\u003c\/span\u003e\u003c\/span\u003e\u003c\/p\u003e\n\u003cp\u003e\u003cspan style=\"color: #000000;\"\u003e\u003cspan\u003eExamination Paper\u003c\/span\u003e\u003c\/span\u003e\u003c\/p\u003e\n\u003cp\u003e\u003cspan style=\"color: #000000;\"\u003e\u003cspan\u003eIndex..\u003c\/span\u003e\u003c\/span\u003e\u003c\/p\u003e\n\u003cp\u003e \u003c\/p\u003e\n\u003cul\u003e\u003c\/ul\u003e","published_at":"2017-09-29T16:39:41+05:30","created_at":"2017-09-29T16:39:42+05:30","vendor":"BPB Publications","type":"Book","tags":[],"price":29700,"price_min":29700,"price_max":29700,"available":true,"price_varies":false,"compare_at_price":33000,"compare_at_price_min":33000,"compare_at_price_max":33000,"compare_at_price_varies":false,"variants":[{"id":47007577480,"title":"Default Title","option1":"Default Title","option2":null,"option3":null,"sku":"9788183335287","requires_shipping":true,"taxable":false,"featured_image":null,"available":true,"name":"Theory Of Computation And Application (Automata Theory, Formal Languages)","public_title":null,"options":["Default Title"],"price":29700,"weight":290,"compare_at_price":33000,"inventory_quantity":99,"inventory_management":"shopify","inventory_policy":"deny","barcode":"9788183335287"}],"images":["\/\/cdn.shopify.com\/s\/files\/1\/2228\/7547\/products\/Theory_of_Computation_and_Application.jpg?v=1506683383"],"featured_image":"\/\/cdn.shopify.com\/s\/files\/1\/2228\/7547\/products\/Theory_of_Computation_and_Application.jpg?v=1506683383","options":["Title"],"media":[{"alt":"Theory Of Computation And Application books","id":265787801644,"position":1,"preview_image":{"aspect_ratio":0.667,"height":2048,"width":1367,"src":"https:\/\/cdn.shopify.com\/s\/files\/1\/2228\/7547\/products\/Theory_of_Computation_and_Application.jpg?v=1568968971"},"aspect_ratio":0.667,"height":2048,"media_type":"image","src":"https:\/\/cdn.shopify.com\/s\/files\/1\/2228\/7547\/products\/Theory_of_Computation_and_Application.jpg?v=1568968971","width":1367}],"content":"\u003cp\u003e\u003cstrong\u003eAuthor: \u003c\/strong\u003e\u003cspan style=\"color: #0000ff;\"\u003eAnil Kumar Malviya \/ Malabika Datta\u003c\/span\u003e\u003c\/p\u003e\n\u003ch5\u003e\n\u003cstrong\u003e\u003c\/strong\u003e\u003cstrong\u003eFeature:\u003c\/strong\u003e\n\u003c\/h5\u003e\n\u003cul\u003e\n\u003cli\u003e\n\u003cstrong\u003eLanguage:\u003c\/strong\u003e English\u003c\/li\u003e\n\u003cli\u003e\n\u003cstrong\u003eBinding:\u003c\/strong\u003e Paperback\u003c\/li\u003e\n\u003cli\u003e\n\u003cstrong\u003ePublisher:\u003c\/strong\u003e BPB Publications\u003c\/li\u003e\n\u003cli\u003e\n\u003cstrong\u003eISBN:\u003c\/strong\u003e 9788183335287\u003c\/li\u003e\n\u003cli\u003e\n\u003cstrong\u003eEdition:\u003c\/strong\u003e 2015\u003c\/li\u003e\n\u003cli\u003e\n\u003cstrong\u003ePages: \u003c\/strong\u003e338\u003c\/li\u003e\n\u003cli\u003e\n\u003cstrong\u003eDimension:\u003c\/strong\u003e 23 X 15.5 X 1.5 cm\u003c\/li\u003e\n\u003c\/ul\u003e\n\u003ch5\u003e\u003cstrong\u003eDescription: \u003c\/strong\u003e\u003c\/h5\u003e\n\u003cp\u003e\u003cspan\u003eThis text book is designed for the first course in Theory of Computation \u0026amp; Application (Automata Theory and Formal Languages) for the students of B.Tech. (CS\/IT) and Master of Computer Applications (MCA) programs of Uttar Pradesh Technical University (UPTU), Lucknow, as well as other Indian Universities. At the end of each chapter a summary for quick revision of concepts and an exercise consisting of objective questions, review questions and programming problems have been given.\u003c\/span\u003e\u003cbr\u003e\u003cbr\u003e\u003c\/p\u003e\n\u003ch4\u003e\u003cspan style=\"color: #000000;\"\u003e\u003cstrong\u003eKey Features:\u003c\/strong\u003e\u003c\/span\u003e\u003c\/h4\u003e\n\u003cul\u003e\n\u003cli\u003e\n\u003cstrong\u003e\u003c\/strong\u003eintroduction and Basic Concepts\u003c\/li\u003e\n\u003cli\u003eFinite Automata\u003c\/li\u003e\n\u003cli\u003eRegular Expressions\u003c\/li\u003e\n\u003cli\u003eRegular and Non- Regular Languages\u003c\/li\u003e\n\u003cli\u003eContext - Free Grammars and Languages\u003c\/li\u003e\n\u003cli\u003ePushdown Automata\u003c\/li\u003e\n\u003cli\u003eProperties Of Context - Free Languages\u003c\/li\u003e\n\u003cli\u003eTuring Machines\u003c\/li\u003e\n\u003cli\u003eRecursively Enumerable Languages and Decidability\u003c\/li\u003e\n\u003cli\u003eModel Question and Examination Papers\u003c\/li\u003e\n\u003c\/ul\u003e\n\u003ch5\u003e\u003cspan style=\"color: #000000;\"\u003e\u003cstrong\u003eTable Of Contents:\u003c\/strong\u003e\u003c\/span\u003e\u003c\/h5\u003e\n\u003cp\u003e\u003cspan style=\"color: #000000;\"\u003eChapter 1. Introduction and Basic Concepts\u003c\/span\u003e\u003c\/p\u003e\n\u003cmeta charset=\"utf-8\"\u003e\n\u003cp\u003e\u003cspan style=\"color: #000000;\"\u003e\u003cspan\u003eChapter 2. Finite Automata\u003c\/span\u003e\u003c\/span\u003e\u003c\/p\u003e\n\u003cmeta charset=\"utf-8\"\u003e\n\u003cp\u003e\u003cspan style=\"color: #000000;\"\u003e\u003cspan\u003eChapter 3. Regular Expressions\u003cbr\u003e\u003c\/span\u003e\u003c\/span\u003e\u003c\/p\u003e\n\u003cmeta charset=\"utf-8\"\u003e\n\u003cp\u003e\u003cspan style=\"color: #000000;\"\u003e\u003cspan\u003eChapter 4. Regular and Non - Regular Languages\u003c\/span\u003e\u003c\/span\u003e\u003c\/p\u003e\n\u003cmeta charset=\"utf-8\"\u003e\n\u003cp\u003e\u003cspan style=\"color: #000000;\"\u003e\u003cspan\u003eChapter 5. Context - Free Grammars and Languages\u003c\/span\u003e\u003c\/span\u003e\u003c\/p\u003e\n\u003cmeta charset=\"utf-8\"\u003e\n\u003cp\u003e\u003cspan style=\"color: #000000;\"\u003e\u003cspan\u003eChapter 6. Pushdown Automata\u003c\/span\u003e\u003c\/span\u003e\u003c\/p\u003e\n\u003cmeta charset=\"utf-8\"\u003e\n\u003cp\u003e\u003cspan style=\"color: #000000;\"\u003e\u003cspan\u003eChapter 7. Properties Of Context - Free Languages\u003cbr\u003e\u003c\/span\u003e\u003c\/span\u003e\u003c\/p\u003e\n\u003cmeta charset=\"utf-8\"\u003e\n\u003cp\u003e\u003cspan style=\"color: #000000;\"\u003e\u003cspan\u003eChapter 8. Turing Machines\u003c\/span\u003e\u003c\/span\u003e\u003c\/p\u003e\n\u003cmeta charset=\"utf-8\"\u003e\n\u003cp\u003e\u003cspan style=\"color: #000000;\"\u003e\u003cspan\u003eChapter 9. Recursively Enumerable Languages and Decidability\u003cbr\u003e\u003c\/span\u003e\u003c\/span\u003e\u003c\/p\u003e\n\u003cp\u003e\u003cspan style=\"color: #000000;\"\u003e\u003cspan\u003eReferences\u003c\/span\u003e\u003c\/span\u003e\u003c\/p\u003e\n\u003cp\u003e\u003cspan style=\"color: #000000;\"\u003e\u003cspan\u003eModel Question Papers\u003c\/span\u003e\u003c\/span\u003e\u003c\/p\u003e\n\u003cp\u003e\u003cspan style=\"color: #000000;\"\u003e\u003cspan\u003eExamination Paper\u003c\/span\u003e\u003c\/span\u003e\u003c\/p\u003e\n\u003cp\u003e\u003cspan style=\"color: #000000;\"\u003e\u003cspan\u003eIndex..\u003c\/span\u003e\u003c\/span\u003e\u003c\/p\u003e\n\u003cp\u003e \u003c\/p\u003e\n\u003cul\u003e\u003c\/ul\u003e"}
You may also like:
Theory Of Computation And Application (Automata Theory, Formal Languages)
Rs. 330
Rs. 297
Author: Anil Kumar Malviya / Malabika Datta Feature: Language: English Binding: Paperback Publisher: BPB Publications ISBN: 9788183335287 Edition: 2015 Pages: 338 Dimension: 23 X 15.5 X 1.5...
