Books > Science & Mathematics > Mathematics > Mathematical foundations
|
Not currently available
Automata Theory and Formal Languages - Fundamental Notions, Theorems, and Techniques (Paperback, 1st ed. 2022)
Loot Price: R1,497
Discovery Miles 14 970
|
|
Automata Theory and Formal Languages - Fundamental Notions, Theorems, and Techniques (Paperback, 1st ed. 2022)
Series: Undergraduate Topics in Computer Science
Supplier out of stock. If you add this item to your wish list we will let you know when it becomes available.
|
Knowledge of automata theory and formal languages is crucial for
understanding human-computer interaction, as well as for
understanding the various processes that take place when
manipulating knowledge if that knowledge is, indeed, expressed as
sentences written in a suitably formalized language. In particular,
it is at the basis of the theory of parsing, which plays an
important role in language translation, compiler construction, and
knowledge manipulation in general. Presenting basic notions and
fundamental results, this concise textbook is structured on the
basis of a correspondence that exists between classes of automata
and classes of languages. That correspondence is established by the
fact that the recognition and the manipulation of sentences in a
given class of languages can be done by an automaton in the
corresponding class of automata. Four central chapters center on:
finite automata and regular languages; pushdown automata and
context-free languages; linear bounded automata and
context-sensitive languages; and Turing machines and type 0
languages. The book also examines decidable and undecidable
problems with emphasis on the case for context-free languages.
Topics and features: Provides theorems, examples, and exercises to
clarify automata-languages correspondences Presents some
fundamental techniques for parsing both regular and context-free
languages Classifies subclasses of decidable problems, avoiding
focus on the theory of complexity Examines finite-automata
minimalization and characterization of their behavior using regular
expressions Illustrates how to derive grammars of context-free
languages in Chomsky and Greibach normal forms Offers supplementary
material on counter machines, stack automata, and abstract language
families This highly useful, varied text/reference is suitable for
undergraduate and graduate courses on automata theory and formal
languages, and assumes no prior exposure to these topics nor any
training in mathematics or logic. Alberto Pettorossi is professor
of theoretical computer science at the University of Rome Tor
Vergata, Rome, Italy.
General
Is the information for this product incomplete, wrong or inappropriate?
Let us know about it.
Does this product have an incorrect or missing image?
Send us a new image.
Is this product missing categories?
Add more categories.
Review This Product
No reviews yet - be the first to create one!
|
You might also like..
|
Email address subscribed successfully.
A activation email has been sent to you.
Please click the link in that email to activate your subscription.