Automata in General Algebras

@article{Eilenberg1967AutomataIG,
  title={Automata in General Algebras},
  author={Samuel Eilenberg and Jesse B. Wright},
  journal={Information and Control},
  year={1967},
  volume={11},
  pages={452-470}
}
The study of automata and of context-free languages usually deals with monoids or semigroups. The purpose of this paper is to propose an extension of the domain of study to other algebraic systems. In the process, a better Understanding of what takes place in monoids can be achieved. The basic language is that of the theory of categories. The basic facts are reviewed in sections 2 and 3. The basic ideas of universal :algebra are then introduced. The key notions are that of a "theory" and of… CONTINUE READING
Highly Cited
This paper has 58 citations. REVIEW CITATIONS

From This Paper

Topics from this paper.

Citations

Publications citing this paper.
Showing 1-10 of 34 extracted citations

58 Citations

0246'69'85'02'19
Citations per Year
Semantic Scholar estimates that this publication has 58 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
Showing 1-9 of 9 references

Generalized finite au tomata theory

J. W. THATCHER, J. B. WRIGHT
1966

Generalized ALGOL - like languages

M. O. RABIN, D. SCOTT
1965

The Algebraic Theory

N. CHOMSKY, M. P. SCHIJTZENBERGER
1963

The Algebraic Theory of Context - Free Languages

M. P. SCHIJTZENBERGER
" Computer Programming and Formal Systems " • 1963

Finite Automata and Their Decision Problems

IBM Journal of Research and Development • 1959

Also to appear in Inform

RC Research Report
Control as Algebraic • 1528

Similar Papers

Loading similar papers…