Finite Automata and Regular Expressions: Problems and Solutions - cover image

Subscribe to our newsletter

* indicates required


Finite Automata and Regular Expressions: Problems and Solutions

Stefan Hollos and J. Richard Hollos

Format and pricing: Paperback (154 pages) $14.95, Kindle/pdf (149 pages) $9.95
ISBN: 9781887187169 (paperback), 9781887187176 (ebook)
Publication date: August 2013

Buy pdf Amazon buy button

This is a book about solving problems related to automata and regular expressions. It helps you learn the subject in the most effective way possible, through problem solving. There are 84 problems with solutions.

The introduction provides some background information on automata, regular expressions, and generating functions.

The inclusion of generating functions is one of the unique features of this book. Few computer science books cover the topic of generating functions for automata and there are only a handful of combinatorics books that mention it. This is unfortunate since we believe the connection between computer science and combinatorics, that is opened up by these generating functions, can enrich both subjects and lead to new methods and applications.

We cover a few interesting classes of problems for finite state automata and then show some examples of infinite state automata and recursive regular expressions. The final problem in the book involves constructing a recursive regular expression for matching regular expressions.

This book explains:

Included in this book:

About the authors

Stefan Hollos and J. Richard Hollos are physicists and electrical engineers by training, and enjoy anything related to math, physics, engineering and computing. They are brothers and business partners at Exstrom Laboratories LLC in Longmont, Colorado.

Table of Contents

Send comments to: Richard Hollos (richard[AT]exstrom DOT com)
Copyright 2021 by Exstrom Laboratories LLC