Skip to Content
Automata Theory and Formal Languages, 2nd Edition
book

Automata Theory and Formal Languages, 2nd Edition

by Władysław Homenda, Witold Pedrycz
July 2026
Intermediate
270 pages
10h 6m
English
De Gruyter
Content preview from Automata Theory and Formal Languages, 2nd Edition

1 Preliminaries

This chapter offers all required prerequisites and elaborates on the notation used throughout the book. As such, the content presented here becomes helpful in the systematic exposure of the material covered in the consecutive chapters.

1.1 Sets

Finite sets include a finite number of members. The empty set, that is, the set which includes no members, is also finite. The empty set is denoted by ∅. Infinite sets include infinitely many members. Infinite sets are countable or uncountable.

We say that a set is countable if and only if its members could be arranged in a particular sequence. In other words, a set is countable if and only if we can enumerate (list) its members assigning natural numbers to them. Such an arrangement ...

Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.

Read now

Unlock full access

More than 5,000 organizations count on O’Reilly

AirBnbBlueOriginElectronic ArtsHomeDepotNasdaqRakutenTata Consultancy Services

QuotationMarkO’Reilly covers everything we've got, with content to help us build a world-class technology community, upgrade the capabilities and competencies of our teams, and improve overall team performance as well as their engagement.
Julian F.
Head of Cybersecurity
QuotationMarkI wanted to learn C and C++, but it didn't click for me until I picked up an O'Reilly book. When I went on the O’Reilly platform, I was astonished to find all the books there, plus live events and sandboxes so you could play around with the technology.
Addison B.
Field Engineer
QuotationMarkI’ve been on the O’Reilly platform for more than eight years. I use a couple of learning platforms, but I'm on O'Reilly more than anybody else. When you're there, you start learning. I'm never disappointed.
Amir M.
Data Platform Tech Lead
QuotationMarkI'm always learning. So when I got on to O'Reilly, I was like a kid in a candy store. There are playlists. There are answers. There's on-demand training. It's worth its weight in gold, in terms of what it allows me to do.
Mark W.
Embedded Software Engineer

You might also like

Algorithmic Thinking, 2nd Edition

Algorithmic Thinking, 2nd Edition

Daniel Zingaro
Learning Algorithms

Learning Algorithms

George Heineman
Algorithms, 4th Edition

Algorithms, 4th Edition

Robert Sedgewick, Kevin Wayne

Publisher Resources

ISBN: 9783112223772