Stem abelian$ (all stems)

29 papers:

LATA-2015-FiciLLP #online

Online Computation of Abelian Runs (GF, TL, AL, ÉPG), pp. 391–401.

CSL-2015-BovaM #finite #first-order #query

First-Order Queries on Finite Abelian Groups (SB, BM), pp. 41–59.

DLT-J-2013-GocRRS14 #automation #on the #word

On the number of Abelian Bordered Words (with an Example of Automatic Theorem-Proving) (DG, NR, MR, PS), pp. 1097–1110.

DLT-2014-EhlersMMN #pattern matching

k-Abelian Pattern Matching (TE, FM, RM, DN), pp. 178–190.

DLT-2014-KarhumakiP #on the #word

On k-Abelian Palindromic Rich and Poor Words (JK, SP), pp. 191–202.

DLT-2014-KarhumakiSZ #equivalence #theorem

Variations of the Morse-Hedlund Theorem for k-Abelian Equivalence (JK, AS, LQZ), pp. 203–214.

DLT-J-2012-KarhumakiPS13 #theorem

Fine and Wilf’s Theorem for k-Abelian Periods (JK, SP, AS), pp. 1135–1152.

DLT-2013-Blanchet-SadriF #complexity #on the #word

On the Asymptotic Abelian Complexity of Morphic Words (FBS, NF), pp. 94–105.

DLT-2013-FiciLLLMP #word

Abelian Repetitions in Sturmian Words (GF, AL, TL, AL, FM, ÉPG), pp. 227–238.

DLT-2013-MercasS

3-Abelian Cubes Are Avoidable on Binary Alphabets (RM, AS), pp. 374–383.

DLT-2013-RampersadRS #on the #word

On the Number of Abelian Bordered Words (NR, MR, PS), pp. 420–432.

DLT-J-2011-DomaratzkiR12 #word

Abelian Primitive Words (MD, NR), pp. 1021–1034.

DLT-2012-KarhumakiPS #theorem

Fine and Wilf’s Theorem for k-Abelian Periods (JK, SP, AS), pp. 296–307.

ICALP-v1-2012-BabaiCQ #morphism #polynomial

Polynomial-Time Isomorphism Test for Groups with No Abelian Normal Subgroups — (Extended Abstract) (LB, PC, YQ), pp. 51–62.

DLT-2011-Blanchet-SadriS #word

Avoiding Abelian Powers in Partial Words (FBS, SS), pp. 70–81.

DLT-2011-DomaratzkiR #word

Abelian Primitive Words (MD, NR), pp. 204–215.

LATA-2010-Blanchet-SadriKMSS #word

Abelian Square-Free Partial Words (FBS, JIK, RM, WS, SS), pp. 94–105.

DLT-2009-GlenHK #word

Crucial Words for Abelian Powers (AG, BVH, SK), pp. 264–275.

CADE-2009-NicoliniRR

Combinable Extensions of Abelian Groups (EN, CR, MR), pp. 51–66.

ICPR-2008-GurS #detection #invariant

Non-Abelian invariant feature detection (YG, NAS), pp. 1–4.

IJCAR-2001-Waldmann #order

Superposition and Chaining for Totally Ordered Divisible Abelian Groups (UW), pp. 226–241.

LICS-2001-GodoyN #constraints #deduction #monad #on the

On Ordering Constraints for Deduction with Built-In Abelian Semigroups, Monoids and Groups (GG, RN), pp. 38–47.

LICS-2000-GodoyN

Paramodulation with Built-in Abelian Groups (GG, RN), pp. 413–424.

CADE-1998-Waldmann

Superposition for Divisible Torsion-Free Abelian Groups (UW), pp. 144–159.

CADE-1996-GanzingerW #monad #proving #theorem proving

Theorem Proving in Cancellative Abelian Monoids (Extended Abstract) (HG, UW), pp. 388–402.

RTA-1993-Zhang #case study

A Case Study of Completion Modulo Distributivity and Abelian Groups (HZ), pp. 32–46.

ICALP-1992-Keranen

Abelian Squares are Avoidable on 4 Letters (VK), pp. 41–52.

LICS-1988-BoudetJS #unification

Unification in Free Extensions of Boolean Rings and Abelian Groups (AB, JPJ, MSS), pp. 121–130.

CADE-1984-LankfordBB #algorithm

A Progress Report on New Decision Algorithms for Finitely Prsented Abelian Groups (DL, GBI, AMB), pp. 128–141.