Some results on the set of congruence relations in a finite, strongly connected automaton-Reference-Cited by-同舟云学术

Some results on the set of congruence relations in a finite, strongly connected automaton

Published:1967-12 Issue:4 Volume:2 Page:353-367
ISSN:0010-485X
Container-title:Computing
language:en
Short-container-title:Computing

Author:

Deussen P.

Publisher

Springer Science and Business Media LLC

Subject

Computational Mathematics,Computational Theory and Mathematics,Computer Science Applications,Numerical Analysis,Theoretical Computer Science,Software

Link

http://link.springer.com/content/pdf/10.1007/BF02235812.pdf

Reference9 articles.

1. Bayer, R.: Automorphism groups and quotients of strongly connected automata and monadic algebras. Report 204. Department of Computer Science, University of Illinois, Urbana. (May, 1966).

2. Bayer, R.: On the endomorphisms and congruences of automata. Mathematical Note 497, Math. Res. Lab., Boeing Scientific Research Laboratories. (Jan. 1967).

3. Birkhoff, G.: Lattice Theory. Am. Math. Soc., Colloquium Publications, Vol. XXV (1961).

4. Clifford, A. H. andG. B. Preston: The algebraic theory of semigroups, Vol. I. Am. Math. Soc., Mathematical Surveys No. 7 (1961).

5. Deussen, P.: On the algebraic theory of finite automata. ICC Bulletin, Vol. 4, No. 4 (1965).

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A characterization of automata and a direct product decomposition;Journal of Computer and System Sciences;1976-08

2. Un Resultat en Theorie des Groupes de Permutations et Son Application au Calcul Effectif du Groupe d’Automorphismes d’Un Automate Fini;Automata, Languages and Programming;1974

3. A structure theory of automata characterized by groups;Journal of Computer and System Sciences;1973-06

4. Congruences et Automorphismes des Automates Finis;Acta Informatica;1971