Hallo! Tracked shipping to Austria with Delivery Duty Paid for just €3.99  

Ship to
Austria
0

My Account

  • argentina
  • chile
  • colombia
  • españa
  • méxico
  • perú
  • estados unidos
  • internacional

menu

Select your country

Americas

Europe

Rest of the world

portada Formal Languages and Computation: Models and Their Applications
Type
Physical Book
Publisher
Author
Language
English
Pages
315
Format
Paperback
ISBN13
9780367378875
Edition No.
1

Formal Languages and Computation: Models and Their Applications

Alexander Meduna (Author) · Auerbach Publications · Paperback

Formal Languages and Computation: Models and Their Applications - Alexander Meduna

Cheaper New Book Imported to Austria
Delivery: 18 Sep - 22 Sep Shipping: 13 to 14 business days.
110,47 €
Faster New Book Imported to Austria
Delivery: 07 Sep - 09 Sep Shipping: 4 to 5 business days.
132,70 €
Import costs and 10% VAT included in the price ✅
110,47 €

Choose the list to add your product or create one New List

Go to My Wishlists
Calculate shipping cost

Synopsis "Formal Languages and Computation: Models and Their Applications "

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

Customers reviews

More customer reviews
  • 0% (0)
  • 0% (0)
  • 0% (0)
  • 0% (0)
  • 0% (0)

Frequently Asked Questions about the Book

Is the book original?

All books in our catalog are Original.

In what language is the book written?

The book is written in English.

What is the format of this book?

The binding of this edition is Paperback.

Questions and Answers about the Book

Do you have a question about the book? Login to be able to add your own question.

Opinions about Bookdelivery

More customer reviews