Results 1 to 10 of about 35 (34)
Some of the next articles are maybe not open access.
Presentations of the Schützenberger Product of n Groups
Communications in Algebra, 2006Helena Sezinando +2 more
exaly
Finitely generated subgroups of free groups as formal languages and their cogrowth [PDF]
Groups, Complexity, Cryptology, 2021 For finitely generated subgroups $H$ of a free group $F_m$ of finite rank $m$, we study the language $L_H$ of reduced words that represent $H$ which is a regular language.
Arman Darbinyan +2 more
doaj +1 more source
Regular matching problems for infinite trees [PDF]
Logical Methods in Computer Science, 2022 We study the matching problem of regular tree languages, that is, "$\exists \sigma:\sigma(L)\subseteq R$?" where $L,R$ are regular tree languages over the union of finite ranked alphabets $\Sigma$ and $\mathcal{X}$ where $\mathcal{X}$ is an alphabet of ...
Carlos Camino +4 more
doaj +1 more source
On nd-K* (n, r)-Full Hypersubstitutions
Discussiones Mathematicae - General Algebra and Applications, 2021 Based on the notion of K* (n, r)-full terms defined by the authors, nd- K* (n, r)-full hypersubstitutions are defined. It turns out that the extension of an nd- K* (n, r)-full hypersubstitution is an endomorphism of the algebra of tree languages of nd- K*
Wattanatripop Khwancheewa +1 more
doaj +1 more source
Factoriality and the Pin-Reutenauer procedure [PDF]
Discrete Mathematics & Theoretical Computer Science, 2016 We consider implicit signatures over finite semigroups determined by sets of pseudonatural numbers. We prove that, under relatively simple hypotheses on a pseudovariety V of semigroups, the finitely generated free algebra for the largest such signature ...
J. Almeida, J. C. Costa, M. Zeitoun
doaj +1 more source
A survey on difference hierarchies of regular languages [PDF]
Logical Methods in Computer Science, 2018 Difference hierarchies were originally introduced by Hausdorff and they play an important role in descriptive set theory. In this survey paper, we study difference hierarchies of regular languages.
Olivier Carton +2 more
doaj +1 more source
On the insertion of n-powers [PDF]
Discrete Mathematics & Theoretical Computer Science, 2019 In algebraic terms, the insertion of $n$-powers in words may be modelled at the language level by considering the pseudovariety of ordered monoids defined by the inequality $1\le x^n$.
J. Almeida, O. Klíma
doaj +1 more source