Skip to Main Content
Foundations of Software Testing: Fundamental Algorithms and Techniques
book

Foundations of Software Testing: Fundamental Algorithms and Techniques

by Aditya P. Mathur
March 2007
Intermediate to advanced content levelIntermediate to advanced
709 pages
20h 23m
English
Pearson India
Content preview from Foundations of Software Testing: Fundamental Algorithms and Techniques
Preliminaries
The following sets are finite languages over the binary alphabet {0, 1}.
The empty set
{}: A language consisting only of one string of length 0
{00, 11, 0101}: A language containing three strings
A regular expression is a convenient means for compact representa-
tion of sets of strings. For example, the regular expression (01)* denotes
the set of strings that consists of the empty string, the string 01, and all
strings obtained by concatenating the string 01 with itself one or more
times. Note that (01)* denotes an infinite set. A formal definition of reg-
ular expressions follows:
Regular expression
Given a finite alphabet X, the following are regular expressions over X:
r
If a belongs to X,thena is a regular expression that denotes the
set ...
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.
Start your free trial

You might also like

Foundations of Software Testing (Fundamental Algorithms and Techniques) by Pearson

Foundations of Software Testing (Fundamental Algorithms and Techniques) by Pearson

Aditya P. Mathur
Fundamentals of Computer Programming and IT by Pearson

Fundamentals of Computer Programming and IT by Pearson

Ashok Namdev Kamthane, Rohit Khurana

Publisher Resources

ISBN: 9788131707951