ALGORITHMS EQUATIONALLY CHARACTERIZING A GROUP OF REGULAR EXPRESSIONS.

This paper gives a thorough and systematic answer to problems concerning regular expressions, finite automata, and right or left linear context-free grammar, i. e. , mutual transformation, reduction, canonical parameter expression, determination of equivalent or inclusive relationships, synthesis of finite-state language analyzer, and synthesis of plural finite automata defined by any of three expressions.