ON THE NUMBER OF ABELIAN BORDERED WORDS (WITH AN EXAMPLE OF AUTOMATIC THEOREM-PROVING)
From MaRDI portal
Publication:5247177
DOI10.1142/S0129054114400267zbMath1309.68162OpenAlexW2096361394MaRDI QIDQ5247177
Narad Rampersad, Daniel Goč, Michel Rigo, Pavel Salimov
Publication date: 23 April 2015
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0129054114400267
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (8)
Asymptotic analysis of \(q\)-recursive sequences ⋮ Abelian combinatorics on words: a survey ⋮ Automaticity and Parikh-Collinear Morphisms ⋮ On highly palindromic words: the \(n\)-ary case ⋮ Abelian bordered factors and periodicity ⋮ Deciding game invariance ⋮ On a theorem concerning partially overlapping subpalindromes of a binary word ⋮ On highly palindromic words: the ternary case
Cites Work
- Restricted involutions and Motzkin paths
- Periodicity and unbordered segments of words
- On highly palindromic words
- Unbordered factors of the characteristic sequences of irrational numbers
- Automatic Theorem-Proving in Combinatorics on Words
- Least Periods of Factors of Infinite Words
- ENUMERATION AND DECIDABLE PROPERTIES OF AUTOMATIC SEQUENCES
- On the Number of Abelian Bordered Words
This page was built for publication: ON THE NUMBER OF ABELIAN BORDERED WORDS (WITH AN EXAMPLE OF AUTOMATIC THEOREM-PROVING)
