Formal Languages and Computation

Models and Their Applications

Alexander Meduna

$189

Hardback

Not in-store but you can order this
How long will it take?

Availability Information

We source books from suppliers in Australia and overseas. For books we don't currently have in stock, the time it takes to get them from our suppliers can vary widely - from a few days to a few months - so we check each book with each supplier to determine the expected time it will take to be supplied to us.

We then advise you accordingly. If the time taken to get any book is too long for you, you can let us know and we will cancel or adjust your order, and refund as required.

To find out the anticipated arrival time for specific items prior to ordering, please contact us by phone or email:

Phone +61 2 9264 3111, or 1800 4 BOOKS (1800 4 26657) if outside Sydney:
option 1 Abbey's Bookshop (Crime, History, Science, Kids & more) • info@abbeys.com.au
option 2 Language Book Centre (ESL & Foreign Languages) • language@abbeys.com.au
option 3 Galaxy Bookshop (Sci-fi, Fantasy, Romance, Graphic Novels) • sf@galaxybooks.com.au

QTY:

English

Auerbach
11 February 2014

Programming & scripting languages: general; Mathematical theory of computation

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

By: Alexander Meduna
Imprint: Auerbach
Country of Publication: United Kingdom
Dimensions: Height: 254mm, Width: 178mm, Spine: 23mm
Weight: 725g
ISBN: 9781466513457
ISBN 10: 1466513454
Pages: 316
Publication Date: 11 February 2014
Audience: College/higher education , College/higher education , A / AS level , Further / Higher Education
Format: Hardback
Publisher's Status: Active

Meduna, Alexander