Normal view MARC view ISBD view

Automata Theory and Formal Languages / Wladyslaw Homenda, Witold Pedrycz.

By: Homenda, Wladyslaw [author.].
Contributor(s): Pedrycz, Witold [author.].
Material type: materialTypeLabelBookSeries: De Gruyter Textbook.Publisher: Berlin ; Boston : De Gruyter, [2022]Copyright date: ©2022Description: 1 online resource (XIV, 232 p.).Content type: text Media type: computer Carrier type: online resourceISBN: 9783110752304.Subject(s): Automaten | Digitale Systeme | Formale Sprachen | Turing Maschinen | COMPUTERS / Information TheoryAdditional physical formats: No title; No titleOnline resources: Click here to access online | Click here to access online | Cover Issued also in print.
Contents:
Frontmatter -- Foreword -- Preface -- Contents -- 1 Preliminaries -- Part I: Grammars and generating languages -- 2 Regular expressions and regular languages -- 3 Context-free grammars -- 4 Context-sensitive grammars and unrestricted grammars -- Part II: Automata and accepting languages -- 5 Turing machines -- 6 Pushdown automata -- 7 Finite automata -- Part III: Revisited: languages, grammars, automata -- 8 Grammars versus automata -- 9 Around the hierarchy of languages -- Bibliography -- Index
Title is part of eBook package:DG Plus DeG Package 2022 Part 1Title is part of eBook package:EBOOK PACKAGE COMPLETE 2022 EnglishTitle is part of eBook package:EBOOK PACKAGE COMPLETE 2022Title is part of eBook package:EBOOK PACKAGE Engineering, Computer Sciences 2022 EnglishTitle is part of eBook package:EBOOK PACKAGE Engineering, Computer Sciences 2022Summary: The book is a concise, self-contained and fully updated introduction to automata theory - a fundamental topic of computer sciences and engineering. The material is presented in a rigorous yet convincing way and is supplied with a wealth of examples, exercises and down-to-the earth convincing explanatory notes. An ideal text to a spectrum of one-term courses in computer sciences, both at the senior undergraduate and graduate students.
    average rating: 0.0 (0 votes)
No physical items for this record

Frontmatter -- Foreword -- Preface -- Contents -- 1 Preliminaries -- Part I: Grammars and generating languages -- 2 Regular expressions and regular languages -- 3 Context-free grammars -- 4 Context-sensitive grammars and unrestricted grammars -- Part II: Automata and accepting languages -- 5 Turing machines -- 6 Pushdown automata -- 7 Finite automata -- Part III: Revisited: languages, grammars, automata -- 8 Grammars versus automata -- 9 Around the hierarchy of languages -- Bibliography -- Index

restricted access online access with authorization star

http://purl.org/coar/access_right/c_16ec

The book is a concise, self-contained and fully updated introduction to automata theory - a fundamental topic of computer sciences and engineering. The material is presented in a rigorous yet convincing way and is supplied with a wealth of examples, exercises and down-to-the earth convincing explanatory notes. An ideal text to a spectrum of one-term courses in computer sciences, both at the senior undergraduate and graduate students.

Issued also in print.

Mode of access: Internet via World Wide Web.

In English.

Description based on online resource; title from PDF title page (publisher's Web site, viewed 02. Mai 2023)

There are no comments for this item.

Log in to your account to post a comment.