J.B. Wright, E.G. Wagner, et al.
Theoretical Computer Science
Many of the important concepts and results of conventional finite automata theory are developed for a generalization in which finite algebras take the place of finite automata. The standard closure theorems are proved for the class of sets "recognizable" by finite algebras, and a generalization of Kleene's regularity theory is presented. The theorems of the generalized theory are then applied to obtain a positive solution to a decision problem of second-order logic. © 1968 Springer-Verlag New York Inc.
J.B. Wright, E.G. Wagner, et al.
Theoretical Computer Science
J.W. Thatcher
ACM SIGPLAN Notices
J.B. Wright, J.W. Thatcher, et al.
FOCS 1976
J.W. Thatcher, E.G. Wagner, et al.
ACM Transactions on Programming Languages and Systems (TOPLAS)