Related papers: A Topological proof that $O_2$ is $2$-MCFL

We present a new proof that $O_2$ is a multiple context-free language. It contrasts with a recent proof by Salvati (2015) in its avoidance of concepts that seem specific to two-dimensional geometry, such as the complex exponential function.…

Classifying formal languages according to the expressiveness of grammars able to generate them is a fundamental problem in computational linguistics and, therefore, in the theory of computation. Furthermore, such kind of analysis can give…

The \emph{word problem} of a group $G = \langle \Sigma \rangle$ can be defined as the set of formal words in $\Sigma^*$ that represent the identity in $G$. When viewed as formal languages, this gives a strong connection between classes of…

Commutative properties in formal languages pose problems at the frontier of computer science, computational linguistics and computational group theory. A prominent problem of this kind is the position of the language $O_n$, the language…

We consider the class of groups whose word problem is poly-context-free; that is, an intersection of finitely many context-free languages. We show that any group which is virtually a finitely generated subgroup of a direct product of free…

We present a necessary condition for an infinite language to be multiple context-free, which we call a Substitution Lemma. We apply it to show a sample selection of languages are not multiple context-free, including the word problem of the…

To Rogers (1994) we owe the insight that monadic second order predicate logic with multiple successors (MSO) is well suited in many respects as a realistic formal base for syntactic theorizing. However, the agreeable formal properties of…

This paper is a continuation of the study of topological properties of omega context free languages (omega-CFL). We proved before that the class of omega-CFL exhausts the hierarchy of Borel sets of finite rank, and that there exist some…

Let $G$ be a group. We can topologize the spaces of left-orderings $LO(G)$ and bi-orderings $O(G)$ of $G$ with the product topology. These spaces may or may not have isolated points. It is known that $LO(F_2)$ has no isolated points, where…

$2$-stratifolds are a generalization of $2$-manifolds in that there are disjoint simple closed curves where several sheets meet. We show that the word problem for fundamental groups of $2$-stratifolds is solvable.

Suppose that G is a finitely generated group and W is the formal language of words defining the identity in G. We prove that if G is a nilpotent group, the fundamental group of a finite volume hyperbolic three-manifold, or a right-angled…

Let $F$ be a non-Archimedean local field. Let $G$ be an algebraic group over $F$. A $G$-variety $X$ defined over $F$ is said to be multiplicity-free if for any admissible irreducible representation $\pi$ of $G(F)$ the following takes place:…

The Surface Group Conjectures are statements about recognising surface groups among one-relator groups, using either the structure of their finite-index subgroups, or all subgroups. We resolve these conjectures in the two generator case.…

In this article, we show the surjectivity of word maps w from SU(2)* SU(2) to SU(2) induced by several families of words in the free group of rank 2. Also, we prove the surjectivity of certain word maps on SL(2,C).

We prove that the \emph{permutation closure} of a multiple context-free language is multiple context-free, which extends work of Okhotin and Sorokin [LATA 2020] who showed closure under \emph{cyclic shift}, and complements work of…

We study verbally closed subgroups of free solvable groups. A number of results is proved that give sufficient conditions under whose a verbally closed subgroup is turned to be a retract and so algebraically closed of the full group.

The word problem of a finitely generated group is the formal language of words over the generators which are equal to the identity in the group. If this language happens to be context-free, then the group is called context-free. Finitely…

We study the links between the topological complexity of an omega context free language and its degree of ambiguity. In particular, using known facts from classical descriptive set theory, we prove that non Borel omega context free…

Let F be the free group on two letters. For {\omega} \in F we study the associated word map {\omega}: SU(n) \times SU(n) \rightarrow SU(n). Extending a method of Goto, we show that for {\omega} not in the second derived subgroup F^(2) of F,…

We give in this paper additional answers to questions of Lescow and Thomas [Logical Specifications of Infinite Computations, In:"A Decade of Concurrency", Springer LNCS 803 (1994), 583-621], proving new topological properties of omega…