Skip to content

Booksellers & Trade Customers: Sign up for online bulk buying at trade.atlanticbooks.com for wholesale discounts

Booksellers: Create Account on our B2B Portal for wholesale discounts

Formal Languages and Computation: Models and Their Applications

by Alexander Meduna
Save 35% Save 35%
Current price ₹5,195.00
Original price ₹7,991.00
Original price ₹7,991.00
Original price ₹7,991.00
(-35%)
₹5,195.00
Current price ₹5,195.00

Imported Edition - Ships in 12-14 Days

Free Shipping in India on orders above Rs. 500

Request Bulk Quantity Quote
+91
Book cover type: Paperback
  • ISBN13: 9780367378875
  • Binding: Paperback
  • Subject: N/A
  • Publisher: Taylor & Francis
  • Publisher Imprint: Auerbach Publications
  • Publication Date:
  • Pages: 315
  • Original Price: GBP 61.99
  • Language: English
  • Edition: N/A
  • Item Weight: 585 grams
  • BISAC Subject(s): Information Theory, Languages / General, and General

Formal Languages and Computation: Models and Their Applications gives a clear, comprehensive introduction to formal language theory and its applications in computer science. It covers all rudimental topics concerning formal languages and their models, especially grammars and automata, and sketches the basic ideas underlying the theory of computation, including computability, decidability, and computational complexity. Emphasizing the relationship between theory and application, the book describes many real-world applications, including computer science engineering techniques for language processing and their implementation.





  • Covers the theory of formal languages and their models, including all essential concepts and properties


  • Explains how language models underlie language processors


  • Pays a special attention to programming language analyzers, such as scanners and parsers, based on four language models-regular expressions, finite automata, context-free grammars, and pushdown automata


  • Discusses the mathematical notion of a Turing machine as a universally accepted formalization of the intuitive notion of a procedure


  • Reviews the general theory of computation, particularly computability and decidability


  • Considers problem-deciding algorithms in terms of their computational complexity measured according to time and space requirements


  • Points out that some problems are decidable in principle, but they are, in fact, intractable problems for absurdly high computational requirements of the algorithms that decide them




In short, this book represents a theoretically oriented treatment of formal languages and their models with a focus on their applications. It introduces all formalisms concerning them with enough rigors to make all results quite clear and valid. Every complicated mathematic

Trusted for over 49 years

Family Owned Company

Secure Payment

All Major Credit Cards/Debit Cards/UPI & More Accepted

New & Authentic Products

India's Largest Distributor

Need Support?

Whatsapp Us