Primitivity, Uniform Minimality, and State Complexity of Boolean Operations
- 6 Downloads
A minimal deterministic finite automaton (DFA) is uniformly minimal if it always remains minimal when the final state set is replaced by a non-empty proper subset of the state set. We prove that a permutation DFA is uniformly minimal if and only if its transition monoid is a primitive group. We use this to study Boolean operations on group languages, which are recognized by direct products of permutation DFAs. A direct product cannot be uniformly minimal, except in the trivial case where one of the DFAs in the product is a one-state DFA. However, non-trivial direct products can satisfy a weaker condition we call uniform Boolean minimality, where only final state sets used to recognize Boolean operations are considered. We give sufficient conditions for a direct product of two DFAs to be uniformly Boolean minimal, which in turn gives sufficient conditions for pairs of group languages to have maximal state complexity under all binary Boolean operations (“maximal Boolean complexity”). In the case of permutation DFAs with one final state, we give necessary and sufficient conditions for pairs of group languages to have maximal Boolean complexity. Our results demonstrate a connection between primitive groups and automata with strong minimality properties.
KeywordsState complexity Finite automaton Primitive group Uniformly minimal Boolean operation Transition monoid
I thank Jason Bell, Janusz Brzozowski and an anonymous referee for careful proofreading and helpful comments. The computer algebra system GAP  was invaluable for this research; I cannot overstate its importance in obtaining these results. In particular, I thank the authors of the Automata GAP package  and all contributors to GAP’s library of primitive groups.
- 2.Araújo, J., Cameron, P.J., Steinberg, B.: Between primitive and 2-transitive: synchronization and its friends. arXiv:1511.03184 (2015)
- 3.Bell, J., Brzozowski, J., Moreira, N., Reis, R.: Symmetric groups and quotient complexity of boolean operations. In: Esparza, J., et al. (eds.) ICALP 2014, LNCS, vol. 8573, pp 1–12. Springer (2014). https://doi.org/10.1007/978-3-662-43951-7_1
- 7.Brzozowski, J.: Unrestricted state complexity of binary operations on regular languages. In: Câmpeanu, C., Manea, F., Shallit, J. (eds.) DCFS 2016, LNCS, vol. 9777, pp 60–72. Springer (2016). https://doi.org/10.1007/978-3-319-41114-9_5
- 10.Brzozowski, J.A., Davies, S., Liu, B.Y.V.: Most complex regular ideal languages. Discret. Math. Theoret. Comput. Sci. 18(3). Paper #15. https://dmtcs.episciences.org/volume/view/id/184 (2016)
- 13.Delgado, M., Linton, S., Morais, J.: Automata – a GAP package, Version 1.13. http://cmup.fc.up.pt/cmup/mdelgado/automata/ (2011)
- 19.The GAP Group: GAP – Groups, Algorithms, and Programming, Version 4.8.6 (2016). http://www.gap-system.org
- 20.Kiraz, G.A.: Compressed storage of sparse finite-state transducers. In: Boldt, O., Jürgensen, H. (eds.) WIA 1999, LNCS, vol. 2214, pp 109–121. Springer (2001). https://doi.org/10.1007/3-540-45526-4_11
- 21.Maslov, A.N.: Estimates of the number of states of finite automata. Dokl. Akad. Nauk SSSR 194, 1266–1268 (Russian) (1970). English translation: Soviet Math. Dokl. 11 (1970) 1373–1375Google Scholar
- 26.Steinberg, B.: A theory of transformation monoids: combinatorics and representation theory. arXiv:https://arxiv.org/abs/1004.2982 (2010)