Green’s Relations in Deterministic Finite Automata
Green’s relations are a fundamental tool in the structure theory of semigroups. They can be defined by reachability in the (right/left/two-sided) Cayley graph. The equivalence classes of Green’s relations then correspond to the strongly connected components. We study the complexity of Green’s relations in semigroups generated by transformations on a finite set. We show that, in the worst case, the number of equivalence classes is in the same order of magnitude as the number of elements. Another important parameter is the maximal length of a chain of strongly connected components. Our main contribution is an exponential lower bound for this parameter. There is a simple construction for an arbitrary set of generators. However, the proof for a constant size alphabet is rather involved. We also investigate the special cases of unary and binary alphabets. All these results are extended to deterministic finite automata and their syntactic semigroups.
KeywordsGreen’s relations Transformation semigroup Automaton Syntactic semigroup Complexity Bounds
We thank the anonymous referees for valuable suggestions which helped to improve the presentation of the paper. We also thank Mikhail Volkov for inspiring comments which led to the addition of Section 5.
- 3.Brandl, C.H., Simon, H.U.: Complexity analysis: Transformation monoids of finite automata. In: Potapov, I. (ed.) DLT 2015, Proceedings, volume 9168 of Lecture Notes in Computer Science, pages 143–154. Springer-Verlag (2015)Google Scholar
- 7.Fleischer, L., Kufleitner, M.: Green’s relations in finite transformation semigroups. In: 2017 Proceedings CSR, volume 10304 of LNCS, pages 112–125. Springer (2017)Google Scholar
- 8.Ganardi, M., Hucke, D., Lohrey, M.: Querying regular languages over sliding windows. In: FSTTCS 2016, Proceedings, volume 65 of LIPIcs, pages 18:1–18:14. Dagstuhl Publishing (2016)Google Scholar