Home » Formal Languages and Computation
Product Image

Formal Languages and Computation

Alexander Meduna
€112.99
Quantity:
Delivery/Collection within 10-20 working days
Shipping & Delivery
A01=Alexander Meduna
advanced computational models in computer science
Author_Alexander Meduna
automata theory applications
Category=UMX
Category=UYA
CFG
Chomsky Normal Form
Church Turing Thesis
Closure Properties
computational complexity
Context Free Languages
decidability theory
Derivation Tree
eq_bestseller
eq_computing
eq_isMigrated=1
eq_isMigrated=2
eq_nobargain
eq_non-fiction
Formal Language Theory
Input String
Input Symbol
Language Processors
Leftmost Derivation
Leftmost Symbol
lexical analysis techniques
LR Parser
mathematical logic foundations
Primitive Recursive Function
Programming Language Analyzers
Pumping Lemma
Pushdown Automata
Pushdown List
Read Write Head
Regular Iff
Regular Languages
Rewriting System
Scanners And Parsers
Set O?
Set OΣ
Start Symbol
Syntax Analysis
syntax analysis methods
Theory Of Computation
Theory Of Formal Languages
TM
Total Function

Product details

  • ISBN 9781466513457
  • Weight: 725g
  • Dimensions: 178 x 254mm
  • Publication Date: 11 Feb 2014
  • Publisher: Taylor & Francis Ltd
  • Publication City/Country: GB
  • Product Form: Hardback
Secure checkout Fast Shipping Easy returns
Description

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
About Alexander Meduna
Meduna, Alexander

More from this author