|
|
|||
|
||||
OverviewThe Book overing finite automata, regular languages, grammars, context-free languages, pushdown automata, Turing machines, decidability, recursive functions, and complexity theory. Clear explanations supported by diagrams and step-by-step derivations Worked examples to strengthen conceptual understanding Solved and unsolved exercises for practice Summary sections for quick revision. Theory of Computation of Formal Languages and Automata Theory included variety of examples solved, exercise, suitable for B.Tech, M.Tech students of Computer Science, IT, etc Full Product DetailsAuthor: Dr Kanchi SureshPublisher: Notion Press Imprint: Notion Press Dimensions: Width: 15.20cm , Height: 2.40cm , Length: 22.90cm Weight: 0.735kg ISBN: 9798903629794Pages: 426 Publication Date: 25 March 2026 Audience: General/trade , General Format: Hardback Publisher's Status: Active Availability: Available To Order We have confirmation that this item is in stock with the supplier. It will be ordered in for you and dispatched immediately. Table of ContentsReviewsAuthor InformationTab Content 6Author Website:Countries AvailableAll regions |
||||