24 citations · 59 across the 16 of their papers we have counts for
1 paper · 1 filter
Victor Selivanov
We develop a theory of k-partitions of the set of infinite words recognizable by classes of finite automata. The theory enables to complete proofs of existing results about topolog…