About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Paper
Algebraic automata and context-free sets
Abstract
The concepts of "equational≓ and "recognizable≓ are defined for sets of elements of an arbitrary abstract algebra. Context-free languages and finite-state languages become realizations of the same general concept (of equational sets) when the proper algebra is specified. A principal objective of the paper is to establish in the context of abstract algebra, relationships between such concepts as equational and recognizable sets. © 1968 Academic Press Inc.