Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1601.08237

The omega-inequality problem for concatenation hierarchies of star-free languages

J. Almeida·O. Klíma·M. Kunc
View original source ↗Read source document ↗Export metadata ↓

Abstract

The problem considered in this paper is whether an inequality of omega-terms is valid in a given level of a concatenation hierarchy of star-free languages. The main result shows that this problem is decidable for all (integer and half) levels of the Straubing-Thérien hierarchy.

Explore related subjects

math.GRcs.FL

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

J. Almeida, O. Klíma, M. Kunc. 2017-05-23. The omega-inequality problem for concatenation hierarchies of star-free languages. https://doi.org/10.1515/forum-2016-0028

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Margulis-Soifer theorem for one-relator groups

We establish the Margulis-Soifer dichotomy for one-relator groups: every one-relator group is either virtually solvable or has a maximal subgroup of infinite index. We also present examples of one-relator groups with and without free maximal subgroups of infinite index, as well as examples that possess both free and non-free infinite index maximal subgroups. Triviality of the Frattini subgroup is also shown for all non-solvable one-relator groups. We close the paper with a short list of questions.

math.GR↗
arXiv2026

Finite quotients of spherical Artin groups

We show the smallest non-abelian quotients of spherical and affine Artin groups are isomorphic to the smallest non-abelian quotients of the corresponding Coxeter groups. We deduce irreducible spherical Artin groups are determined by their finite quotient groups.

math.GR↗
arXiv2026

Cosets with constant characteristic polynomial

Let H be a linear group. We show that if there is an invertible matrix x such that all the elements of xH share the same characteristic polynomial then H is virtually solvable. There are plenty of applications that will be presented in future paper. Here, we discuss some applications to the generalized Weigold conjecture and present an alternative straightforward proof of the Formanek--Procesi nonlinearity theorem for Aut(F_n), n>2, over every field. When n>5 our non-linearity proof gives a stronger result than the original Formanek--Procesi theorem.

math.GR↗