Abstract
The separating words problem asks - given two words \(w, x \in \{0,1\}^n\), the size of the smallest automaton (in terms of number of states, expressed as a function of n) which accepts one of them and rejects the other. The best lower bound known for the problem is \(\varOmega (\log n)\), whereas the best upper bound known is \(O(n^{1/3} \log ^7 n)\), due to (Chase 2021). Motivated by the applications to this problem, we study separating in the context of groups - a finite group G is said to separate w and x, if there is a substitution function from \(\phi : \varSigma \rightarrow G\) such that the expressions \(\phi (w)\) and \(\phi (x)\) yield different elements in the group G. We show the following results:
-
By a result of RobsonĀ [6], there is a permuting automaton of size \(O(\sqrt{n})\) states which separate any two words w and x of length n. Hence, there is a group of size \(2^{O(\sqrt{n}\log n)}\) which separate w and x. Using basic properties of one dimensional representations of the groups, we improve this to \(O(\sqrt{n}2^{\sqrt{n}})\).
-
A class of groups \(\mathcal {G}\) is said to be universal if for any two words \(w, x \in \varSigma ^*\), there exists a group \(G \in \mathcal {G}\) for which a separating substitution map exists such that the yields of the words under the map are distinct. We show that the class of permutation groups, solvable groups, nilpotent groups and, in particular, p-groups, are universal.
-
Class of Abelian groups and Dihedral groups are not universal. En route to this result, we derive sufficiency conditions for a class of groups to be non-universal.
-
We can also translate separation using groups to separation using automaton. Any two words \(w,x \in \varSigma ^n\) which are separated by a group G can be separated using an automaton of size |G|. We show better bounds for permutation groups. We also study the natural computational problem in the context and show it to be \(\textsf {NP}\)-complete.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Bulatov, A.A., Karpova, O., Shur, A.M., Startsev, K.: Lower bounds on words separation: Are there short identities in transformation semigroups? Electron. J. Comb. 24(3), 3 (2017)
Chase, Z.: Separating words and trace reconstruction. In: STOC 2021, pp. 21ā31. Association for Computing Machinery (2021)
Fulton, W., Harris, J.: Representation Theory. GTM, vol. 129. Springer, New York (2004). https://doi.org/10.1007/978-1-4612-0979-9
GoralÄĆk, P., Koubek, V.: On discerning words by automata. In: Kott, L. (ed.) ICALP 1986. LNCS, vol. 226, pp. 116ā122. Springer, Heidelberg (1986). https://doi.org/10.1007/3-540-16761-7_61
Johnson, J.H.: Rational Equivalence Relations. In Laurent Kott, editor, Automata, Languages and Programming, pp. 167ā176, Berlin, Heidelberg, 1986. Springer, Berlin Heidelberg
Robson, J.M.: Separating words with machines and groups. RAIRO - Theoretical Informatics and Applications - Informatique ThĆ©orique et Appl. 30(1), 81ā86 (1996)
Robson, J.M.: Separating strings with small automata. Inf. Process. Lett. 30(4), 209ā214 (1989)
Wiedermann, J.: Discerning Two Words by a Minimum Size Automaton. Technical report, Institute of Computer Science, The Czech Academy of Sciences (2015)
Acknowledgements
The authors would like to thank the anonymous reviewers of DCFS 2023 for the helpful comments.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
Ā© 2023 IFIP International Federation for Information Processing
About this paper
Cite this paper
Kuntewar, N., Anoop, S.K.M., Sarma, J. (2023). Separating Words Problem overĀ Groups. In: Bordihn, H., Tran, N., Vaszil, G. (eds) Descriptional Complexity of Formal Systems. DCFS 2023. Lecture Notes in Computer Science, vol 13918. Springer, Cham. https://doi.org/10.1007/978-3-031-34326-1_8
Download citation
DOI: https://doi.org/10.1007/978-3-031-34326-1_8
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-34325-4
Online ISBN: 978-3-031-34326-1
eBook Packages: Computer ScienceComputer Science (R0)