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
EXERCISES
EXERCISES
3.1 Modify the DIGDEC machine shown in Figure 3.3 so that it
accepts a string over the alphabet X ={d, ∗}. For example, strings
such as s = 324 41 9 199 ∗∗230 are valid inputs. An
asterisk causes the machine to execute the OUT(num) function
where num denotes the decimal number corresponding to the
digits received prior to the current asterisk but after any previous
asterisk. Thus, the output of the machine for input string s will be:
OUT(324) OUT(41) OUT(9) OUT(199) OUT(230)
Note that the machine does not perform any action if it receives
an asterisk following another asterisk.
3.2 Show that (a) V-equivalence and equivalence of states and
machines as defined in Section 3.2.3 are equivalence relations,
that is they obey the refle ...
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