Automata theory and formal languages : fundamental notions, theorems and techniques / Alberto Pettorossi

By:

Pettorossi, Alberto [author]

Material type: Text

TextSeries: Undergraduate Topics in Computer SciencePublication details: Switzerland : Springer, c2022Description: vii, 280 leaves ; 26 cmISBN:

9783031119644

Subject(s):

LOC classification:

QA 267.3 .P48 2022

Contents:

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.

Summary: 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.

Item type:

Books

Tags from this library: No tags from this library for this title. Log in to add tags.

Average rating: 0.0 (0 votes)

Holdings
Item type	Current library	Home library	Collection	Call number	Copy number	Status	Date due	Barcode
Books	National University - Manila	LRC - Main General Circulation	Digital Forensic	GC QA 267.3 .P48 2022 (Browse shelf(Opens below))	c.1	Available		NULIB000020476

Browsing LRC - Main shelves, Shelving location: General Circulation, Collection: Digital Forensic Close shelf browser (Hides shelf browser)

Previous						No cover image available		Next
Previous	GC QA 76.758 .R53 2020 Fundamentals of software architecture : an engineering approach /	GC QA 76.774.L46 .S3 2021 Linux cookbook : essential skills for Linux users and system and network administrators /	GC QA 76.774.M33 .W37 2022 The Art of mac malware : the guide to analyzing malicious software /	GC QA 267.3 .P48 2022 Automata theory and formal languages : fundamental notions, theorems and techniques /	GC QA 267.3 .S26 2020 Windows operating system fundamentals /	GC QA 267.3 .S47 2020 Automata, formal languages, and turing mahines /	GC QA 297.4 .K86 2020 Discrete mathematical structures : a succinct foundation /	Next

Includes bibliographical references and index.

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.

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.

There are no comments on this title.

to post a comment.