Local groups in free groupoids satisfying certain monoid identities (2002)
- Autor:
- Autor USP: LAGO, ALAIR PEREIRA DO - IME
- Unidade: IME
- DOI: 10.1142/S0218196702000961
- Assunto: TEORIA DOS GRUPOS
- Language: Inglês
- Imprenta:
- Source:
- Título do periódico: International Journal of Algebra and Computation
- ISSN: 1793-6500
- Volume/Número/Paginação/Ano: v. 12, n. 1-2, p. 357-369, 2002
- Este periódico é de assinatura
- Este artigo NÃO é de acesso aberto
- Cor do Acesso Aberto: closed
-
ABNT
LAGO, Alair Pereira do. Local groups in free groupoids satisfying certain monoid identities. International Journal of Algebra and Computation, v. 12, n. 1-2, p. 357-369, 2002Tradução . . Disponível em: https://doi.org/10.1142/S0218196702000961. Acesso em: 18 abr. 2024. -
APA
Lago, A. P. do. (2002). Local groups in free groupoids satisfying certain monoid identities. International Journal of Algebra and Computation, 12( 1-2), 357-369. doi:10.1142/S0218196702000961 -
NLM
Lago AP do. Local groups in free groupoids satisfying certain monoid identities [Internet]. International Journal of Algebra and Computation. 2002 ; 12( 1-2): 357-369.[citado 2024 abr. 18 ] Available from: https://doi.org/10.1142/S0218196702000961 -
Vancouver
Lago AP do. Local groups in free groupoids satisfying certain monoid identities [Internet]. International Journal of Algebra and Computation. 2002 ; 12( 1-2): 357-369.[citado 2024 abr. 18 ] Available from: https://doi.org/10.1142/S0218196702000961 - Sobre os semigrupos de burnside 'X POT.N'='X POT.N+M'
- Lossless filter for multiple repetitions with Hamming distance
- On the Burnside semigroups 'x POT.n' ='x POT.n+m'
- Maximal groups in free Burnside semigroups
- On the Burnside semigroups xn = xn+m
- A new algorithm for sparse suffix trees
- Comparison with parametric optimization in credit card fraud detection
- 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
- A sparse dynamic programming algorithm for alignment with non-overlapping inversions
Informações sobre o DOI: 10.1142/S0218196702000961 (Fonte: oaDOI API)
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas