On the Burnside semigroups 'x POT.n' ='x POT.n+m' (1992)
- Autor:
- Autor USP: LAGO, ALAIR PEREIRA DO - IME
- Unidade: IME
- DOI: 10.1007/BFb0023839
- Assunto: SEMIGRUPOS (COMBINATÓRIA)
- Keywords: maximal subgroup; word problem; stable production; stability theorem; small period
- Language: Inglês
- Imprenta:
- Source:
- Título: Proceedings
- Conference titles: Latin American Symposium on Theoretical Informatics - LATIN '92
- Status:
- Nenhuma versão em acesso aberto identificada
-
ABNT
LAGO, Alair Pereira do. On the Burnside semigroups 'x POT.n' ='x POT.n+m'. 1992, Anais.. Berlin: Springer, 1992. Disponível em: https://doi.org/10.1007/BFb0023839. Acesso em: 14 abr. 2026. -
APA
Lago, A. P. do. (1992). On the Burnside semigroups 'x POT.n' ='x POT.n+m'. In Proceedings. Berlin: Springer. doi:10.1007/BFb0023839 -
NLM
Lago AP do. On the Burnside semigroups 'x POT.n' ='x POT.n+m' [Internet]. Proceedings. 1992 ;[citado 2026 abr. 14 ] Available from: https://doi.org/10.1007/BFb0023839 -
Vancouver
Lago AP do. On the Burnside semigroups 'x POT.n' ='x POT.n+m' [Internet]. Proceedings. 1992 ;[citado 2026 abr. 14 ] Available from: https://doi.org/10.1007/BFb0023839 - A new algorithm for sparse suffix trees
- Comparison with parametric optimization in credit card fraud detection
- On the Burnside semigroups xn = xn+m
- Lossless filter for multiple repeats with bounded edit distance
- Fraud detection in reputation systems in e-markets using logistic regression
- Stable two-sided matching of slot allocation in airport collaborative decision making
- A convexity upper bound for the number of maximal bicliques of a bipartite graph
- Local groups in free groupoids satisfying certain monoid identities
- Lossless filter for multiple repetitions with Hamming distance
- Maximal groups in free Burnside semigroups
Informações sobre a disponibilidade de versões do artigo em acesso aberto coletadas automaticamente via oaDOI API (Unpaywall).
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
