Frobenius groups generated by two elements of order 3.
Zhurtov, A.Kh. (2001)
Sibirskij Matematicheskij Zhurnal
Similarity:
Zhurtov, A.Kh. (2001)
Sibirskij Matematicheskij Zhurnal
Similarity:
Dolbak, L.V. (2006)
Sibirskij Matematicheskij Zhurnal
Similarity:
Lytkina, D.V., Tukhvatullina, L.R., Filippov, K.A. (2008)
Sibirskij Matematicheskij Zhurnal
Similarity:
Vorob'eva, E.V., Romanovskij, R.K. (2000)
Siberian Mathematical Journal
Similarity:
Abrosimov, N.V. (2006)
Sibirskie Ehlektronnye Matematicheskie Izvestiya [electronic only]
Similarity:
Lyul'ko, N. A. (2002)
Sibirskij Matematicheskij Zhurnal
Similarity:
Kondrat'ev, A.S., Mazurov, V.D. (2000)
Siberian Mathematical Journal
Similarity:
Dinariev, O.Yu. (2000)
Siberian Mathematical Journal
Similarity:
Romanov, V.G. (2008)
Sibirskij Matematicheskij Zhurnal
Similarity:
Pinus, A.G. (2006)
Sibirskij Matematicheskij Zhurnal
Similarity:
Andrzej Schinzel (1995)
Acta Arithmetica
Similarity:
Vinokurov, N.S. (2006)
Sibirskie Ehlektronnye Matematicheskie Izvestiya [electronic only]
Similarity:
Michał Trybulec (2008)
Formalized Mathematics
Similarity:
This is the second article on regular expression quantifiers. [4] introduced the quantifiers m to n occurrences and optional occurrence. In the sequel, the quantifiers: at least m occurrences and positive closure (at least 1 occurrence) are introduced. Notation and terminology were taken from [8], several properties of regular expressions from [7].MML identifier: FLANG 3, version: 7.8.05 4.89.993