Advertisement

Matching

Chapter
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2100)

Abstract

In this chapter, the results on matching already summarized in Section 3.2.5 are proved. As in the previous two chapters, this is done in three separate sections containing proofs for ALNS, ALN *, and ALE (as well as sublanguages thereof).

Keywords

Normal Form Matching Algorithm Polynomial Time Algorithm Match Problem Regular Language 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2001

Personalised recommendations