Related papers: Listing Words in Free Groups
We consider some questions about formal languages that arise when inverses of letters, words and languages are defined. The reduced representation of a language over the free monoid is its unique equivalent representation in the free group.…
For every finite rank k, k>1, we explicitly construct (2k)! left orders on the free group F_k of rank k. Each order is induced by a word of length 2k in which each generator of F_k and its inverse appear exactly once. For each of these…
Given a group $G$ and a subset $X \subset G$, an element $g \in G$ is called quasi-positive if it is equal to a product of conjugates of elements in the semigroup generated by $X$. This notion is important in the context of braid groups,…
We investigate the orbits of automaton semigroups and groups to obtain algorithmic and structural results, both for general automata but also for some special subclasses. First, we show that a more general version of the finiteness problem…
In this paper, we study the word problem for automaton semigroups and automaton groups from a complexity point of view. As an intermediate concept between automaton semigroups and automaton groups, we introduce automaton-inverse semigroups,…
Certain families of combinatorial objects admit recursive descriptions in terms of generating trees: each node of the tree corresponds to an object, and the branch leading to the node encodes the choices made in the construction of the…
We analyze here a particular kind of linguistic network where vertices representwords and edges stand for syntactic relationships between words. The statisticalproperties of these networks have been recently studied and various features…
The free $\mathbb{Z}$-module generated from the set of non-trivial homotopy classes of closed curves on an oriented surface has the structure of Lie bialgebra by two operations, the Goldman bracket and Turaev cobracket. M. Chas gave a…
For an arbitrary countable group G = <A|R> given by its generators A and defining relations R we discuss a specific method for embedding of G into a certain 2-generator group T. Our embedding explicitly lists the images of generators from A…
(1) There is a finitely presented group with a word problem which is a uniformly effectively inseparable equivalence relation. (2) There is a finitely generated group of computable permutations with a word problem which is a universal…
Let $F$ be a finitely generated free group. We present an algorithm such that, given a subgroup $H\leqslant F$, decides whether $H$ is the fixed subgroup of some family of automorphisms, or family of endomorphisms of $F$ and, in the…
An equivalence relation in the symmetric group, where is a positive integer has been considered. An algorithm for calculation of the number of the equivalence classes by this relation for arbitrary integer has been described.
We re-cast in a more combinatorial and computational form the foldings approach of John Stallings and pursue a detailed study of the subgroup structure of free groups. In particular, we introduce the notions of an "algebraic" and a "free"…
We study random words in a weighted regular language that achieve the maximal free energy using thermodynamics formalism. In particular, typical words in the language are algorithmically generated which have applications in computer…
In this paper, we introduce a novel approach for generating random elements of a finite group given a set of generators of that. Our method draws upon combinatorial group theory and automata theory to achieve this objective. Furthermore, we…
A word $w$ in a free group is called {\em chiral} if there exists a group $G$ such that image of word map corresponding to word $w$ is not closed with respect to inverse. Similarly a group $G$ is said to be {\em chiral} if there exists a…
Why do some languages like Czech permit free word order, while others like English do not? We address this question by pretraining transformer language models on a spectrum of synthetic word-order variants of natural languages. We observe…
Howie and Duncan observed that a word in a free product with length at least two and which is not a proper power can be decomposed as a product of two cyclic subwords each of which is uniquely positioned. Using this property, they proved…
Dictionaries are inherently circular in nature. A given word is linked to a set of alternative words (the definition) which in turn point to further descendants. Iterating through definitions in this way, one typically finds that…
Let E be a number field and G be a finite group. Let A be any O_E-order of full rank in the group algebra E[G] and X be a (left) A-lattice. In a previous article, we gave a necessary and sufficient condition for X to be free of given rank d…