Journal of the ACM · 1966 · 284 citations · 4 references
ComputingComputer ScienceMathematicsAlgebraLogicRepresentation TheoryAutomata TheoryEvent RepresentationFinite AutomataFormal Language FoundationsFormal LanguagesFormal SemanticsAxiom SystemsAxiomatization Of Algebraic StructuresFinite Automata TheoryRegular Expressions
The theory of finite automata is closely linked with the theory of Kleene's regular expressions. In this paper, two formal systems for the algebraic transformation of regular expressions are developed. Both systems are consistent and complete; i.e., the set of equations derivable within the system equals the set of equations between two regular expressions denoting the same event. One of the systems is based upon the uniqueness of the solution of certain regular expression equations, whereas some facts concerning the representation theory of regular events are used in connection with the other.
4
Derivatives of Regular Expressions
Janusz Brzozowski · Journal of the ACM · 1964 · 931 citations · Full text
Delayed-logic and finite-state machines
Dean N. Arden · 1961 · 104 citations
Realization of Events by Logical Nets
Irving M. Copi, Calvin C. Elgot, Jesse B. Wright · Journal of the ACM · 1958 · 99 citations · Full text