Automata Theory and Formal Languages

Fundamental Notions, Theorems, and Techniques

AvAlberto Pettorossi

Häftad, Engelska, 2022

Del i serien Undergraduate Topics in Computer Science

666 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt över 249 kr.

Fler format och utgåvor

E-bok

870 kr

Beskrivning

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 correspondencesPresents some fundamental techniques for parsing both regular and context-free languagesClassifies subclasses of decidable problems, avoiding focus on the theory of complexityExamines finite-automata minimalization and characterization of their behavior using regular expressionsIllustrates how to derive grammars of context-free languages in Chomsky and Greibach normal formsOffers supplementary material on counter machines, stack automata, and abstract language familiesThis highly useful, varied text/reference is suitable for undergraduate and graduatecourses 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.

Produktinformation

Utgivningsdatum:2022-08-13
Mått:178 x 254 x 15 mm
Vikt:612 g
Format:Häftad
Språk:Engelska
Serie:Undergraduate Topics in Computer Science
Antal sidor:280
Upplaga:22001
Förlag:Springer International Publishing AG
ISBN:9783031119644

Utforska kategorier

Mer om författaren

Alberto Pettorossi is Professor of Theoretical Computer Science at the Engineering Faculty of the University of Rome Tor Vergata (Italy). His current research interests include the development of logic-based techniques for the automatic derivation, transformation, and verification of programs.

Recensioner i media

“This textbook covers a great deal of classical automata theory and formal languages and should be useful in teaching an introductory course on this subject, particularly to students in computer science.” (Roger Villemaire, zbMATH 1527.68002, 2024)

Innehållsförteckning

1 Formal Grammars and Languages.- 2 Finite Automata and Regular Grammars.- 3 Pushdown Automata and Context-Free Grammars.- 4 Linear Bounded Automata and Context-Sensitive Grammars.- 5 Turing Machines and Type 0 Grammars.- 6 Decidability and Undecidability in Context-Free Languages.- 7 Supplementary Topics.

Mer från samma författare

Automatic Program Development

Olivier Danvy, Fritz Henglein, Harry Mairson, Alberto Pettorossi

Inbunden, 2008

1 138 kr

Automatic Program Development

Alberto Pettorossi, Harry Mairson, Fritz Henglein, Olivier Danvy

E-bok

2008

1 470 kr

Techniques for Searching, Parsing, and Matching

Alberto Pettorossi

Inbunden, 2022

1 024 kr

Techniques for Searching, Parsing, and Matching

Alberto Pettorossi

E-bok

2022

894 kr

Techniques for Searching, Parsing, and Matching

Alberto Pettorossi

Häftad, 2023

742 kr

Logic Based Program Synthesis and Transformation

Alberto Pettorossi

Häftad, 2002

572 kr

Logic Based Program Synthesis and Transformation

Alberto Pettorossi

E-bok

2003

739 kr

Meta-Programming in Logic

Alberto Pettorossi

Häftad, 1992

556 kr

Automatic Program Development

Olivier Danvy, Fritz Henglein, Harry Mairson, Alberto Pettorossi

Häftad, 2010

1 138 kr

Mer från samma serie

Beginners Guide to Python 3 Programming

John Hunt

Häftad, 2023

742 kr

Guide to Data Privacy

Vicenç Torra

Häftad, 2022

459 kr

Fundamentals of Discrete Math for Computer Science

Tom Jenkyns, Ben Stephenson

Häftad, 2018

461 kr

Object-Oriented Analysis, Design and Implementation

Brahma Dathan, Sarnath Ramnath

Häftad, 2025

685 kr

Rigorous Software Development

José Bacelar Almeida, Maria João Frade, Jorge Sousa Pinto, Simão Melo de Sousa

Häftad, 2026

685 kr

Sets, Logic and Maths for Computing

David Makinson

Häftad, 2020

381 kr

Programming Languages: Principles and Paradigms

Maurizio Gabbrielli, Simone Martini

Häftad, 2023

629 kr

Proofs and Algorithms

Gilles Dowek

Häftad, 2011

402 kr

Elements of Computer Security

David Salomon

Häftad, 2010

402 kr

Introduction to the Theory of Programming Languages

Gilles Dowek, Jean-Jacques Lévy

Häftad, 2010

402 kr

Du kanske också är intresserad av

Nyhet

Exit Adventskalender - Julens magi (SE)

Exit

499 kr