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).
KeywordsNormal Form Matching Algorithm Polynomial Time Algorithm Match Problem Regular Language
Unable to display preview. Download preview PDF.