On AFL generators for finitely encoded AFA

摘要

Two languages, Download : Download full-size image and Download : Download full-size image, are introduced for each finitely encoded AFA Download : Download full-size image. Then two conditions on Download : Download full-size image are presented, each of which guarantees that Download : Download full-size image and Download : Download full-size image are generators for the AFL defined by Download : Download full-size image. Using Download : Download full-size image and Download : Download full-size image, generators are exhibited for a number of well-known AFL in computer science. Finally, it is shown that each of the above conditions, in conjunction with a third condition, permits every language in the AFL defined by Download : Download full-size image to have a representation in the form Download : Download full-size image, where R is a regular set and h1 and h2 are homomorphisms, with h2 nondecreasing.