Implementation of finite automaton algorithms bustructuredprograms. II

The paper is concerned with ways to minimize the memory space taken up by structured stack-controlled programs driven by input data and implementing finite automation algorithms. An asymptotic complexity estimate of such programs is provided.