The non-abelian squares are not context-free
Formal Languages and Automata Theory
2011-10-20 v1
Authors:
Shuo Tan
Abstract
Answering a recent question of Crochemore, we prove that the language of words that are not abelian squares is not context-free.
Cite
@article{arxiv.1110.4136,
title = {The non-abelian squares are not context-free},
author = {Shuo Tan},
journal= {arXiv preprint arXiv:1110.4136},
year = {2011}
}
Related papers
View all related →
Formal Languages and Automata Theory · Computer Science
Abelian Primitive Words
Michael Domaratzki, Narad Rampersad
2010-06-25
Formal Languages and Automata Theory · Computer Science
Non-closure under complementation for unambiguous linear grammars
Olga Martynova, Alexander Okhotin
2022-10-06
Group Theory · Mathematics
Groups with poly-context-free word problem
Tara Brough
2015-10-09
Combinatorics · Mathematics
On the context-freeness of the set of words containing overlaps
Narad Rampersad
2009-03-29
Combinatorics · Mathematics
Solved and unsolved problems about abelian squares
Jamie Simpson
2018-02-14
Group Theory · Mathematics
Some word maps that are non-surjective on infinitely many finite simple groups
Sebastian Jambor, Martin W. Liebeck, E. A. O'Brien
2014-02-26
Discrete Mathematics · Computer Science
Borders, Palindrome Prefixes, and Square Prefixes
Daniel Gabric, Jeffrey Shallit
2020-06-05
Combinatorics · Mathematics
No extremal square-free words over large alphabets
Letong Hong, Shengtong Zhang
2023-02-07
Group Theory · Mathematics
Linearity problem for non-abelian tensor products
Valeriy G. Bardakov, Andrei V. Lavrenov, Mikhail V. Neshchadim
2018-04-13
Formal Languages and Automata Theory · Computer Science
Constructing Premaximal Binary Cube-free Words of Any Level
Elena A. Petrova, Arseny M. Shur
2011-08-19
Group Theory · Mathematics
Strongly verbally closed groups
Andrey M. Mazhuga
2017-07-19
Formal Languages and Automata Theory · Computer Science
Logic for Unambiguous Context-Free Languages
Yassine Hachaïchi
2016-04-15
Discrete Mathematics · Computer Science
A local balance property of episturmian words
Gwénaël Richomme
2008-02-07
Formal Languages and Automata Theory · Computer Science
An undecidable property of context-free languages
Zoltan Esik
2010-04-13
Discrete Mathematics · Computer Science
Words with the Maximum Number of Abelian Squares
Gabriele Fici, Filippo Mignosi
2015-06-12
Group Theory · Mathematics
Quasigeodesic languages are not context-free in some non-hyperbolic groups
Arya Saranathan
2026-04-28
Algebraic Geometry · Mathematics
On Unirationality of Quartics over non Algebraically Closed Fields
Nikolay Zak
2007-08-21
Group Theory · Mathematics
On abstract commensurators of groups
Laurent Bartholdi, Oleg Bogopolski
2015-01-29
High Energy Physics - Theory · Physics
Non-abelian T-folds
Mark Bugden
2019-04-02
Formal Languages and Automata Theory · Computer Science
Marciani Normal Form of context-free grammars
Giacomo Marciani
2016-11-08
Combinatorics · Mathematics
Binary Words Containing Few Abelian Squares
Szilard Zsolt Fazekas, Adam Mammoliti, Robert Mercas, Jamie Simpson
2026-04-28
Discrete Mathematics · Computer Science
Maximum Number of Distinct and Nonequivalent Nonstandard Squares in a Word
Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Waleń
2016-04-11
Combinatorics · Mathematics
Some further results on squarefree arithmetic progressions in infinite words
James Currie, Tero Harju, Pascal Ochem, Narad Rampersad
2019-01-21
Combinatorics · Mathematics
Some combinatorial sequences associated with context-free grammars
Shi-Mei Ma
2012-08-21
Formal Languages and Automata Theory · Computer Science
Splicing systems and the Chomsky hierarchy
Jean Berstel, Luc Boasson, Isabelle Fagnot
2011-02-07