3 citations · 5 across the 6 of their papers we have counts for
Showing 2016Show all
2 papers · 1 filter
cs.FL2016★ 3 cited
Completely Reachable Automata
Evgenija Bondar, Mikhail Volkov
We present a few results and several open problems concerning complete deterministic finite automata in which every non-empty subset of the state set occurs as the image of the who…
math.GR2016
Local finiteness for Green relations in (I-)semigroup varieties
Pedro V. Silva, Filipa Soares
In this work, the lattice of varieties of semigroups and the lattice of varieties of I-semigroups (a common setting for both the variety of completely regular semigroups and the va…