Paper Info
Title
Some results on the set of congruence relations in a finite, strongly connected automaton.
Abstract
The congruence relations of an automaton are of interest for various reasons. For example they are relevant for minimization procedures and they are suitable for decomposing the automaton in a specific way which is of technical importance [Hartmanis et al.].
Year
DOI
Venue
1967
10.1007/BF02235812
Computing
Field
DocType
Volume
Elementary cellular automaton,Continuous automaton,Two-way deterministic finite automaton,Deterministic automaton,Algebra,Powerset construction,Block cellular automaton,Mathematics,Probabilistic automaton,Büchi automaton
Journal
2
Issue
ISSN
Citations 
4
1436-5057
5
PageRank 
References 
Authors
0.83
3
1
Name
Order
Citations
PageRank
Peter Deussen15626.79