1 Homing and Synchronizing Sequences

  • Sven Sandberg
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3472)


This chapter considers two fundamental problems for Mealy machines, i.e., finite-state machines with inputs and outputs. The machines will be used in subsequent chapters as models of a system or program to test. We repeat Definition 21.1 of Chapter 21 here: readers already familiar with Mealy machines can safely skip to Section 1.1.2.


Conjunctive Normal Form Input String Input Symbol Generate Test Case Product Machine 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Sven Sandberg
    • 1
  1. 1.Department of Information TechnologyUppsala University 

Personalised recommendations