English
Related papers

Related papers: Recognizing pro-R closures of regular languages

200 papers

We consider the problem of constructing semisimple subalgebras of real (semi-) simple Lie algebras. We develop computational methods that help to deal with this problem. Our methods boil down to solving a set of polynomial equations. In…

Rings and Algebras · Mathematics 2013-10-02 Paolo Faccin , Willem A. de Graaf

The atoms of a regular language are non-empty intersections of complemented and uncomplemented quotients of the language. Tight upper bounds on the number of atoms of a language and on the quotient complexities of atoms are known. We…

Formal Languages and Automata Theory · Computer Science 2014-05-23 Janusz Brzozowski , Gareth Davies

The paper explains the connection between topological theories for one-manifolds with defects and values in the Boolean semiring and automata and their generalizations. Finite state automata are closely related to regular languages. To each…

Quantum Algebra · Mathematics 2022-03-07 Mee Seong Im , Mikhail Khovanov

In this paper, we shall present a topological approach for the computation of some supremal sublanguages, often specified by language equations, which arise from the study of the supervisory control theory. The basic idea is to identify the…

Formal Languages and Automata Theory · Computer Science 2021-11-30 Liyong Lin , Rong Su

We build a notion of algebraic recognition for visibly pushdown languages by finite algebraic objects. These come with a typical Eilenberg relationship, now between classes of visibly pushdown languages and classes of finite algebras.…

Formal Languages and Automata Theory · Computer Science 2018-10-31 Silke Czarnetzki , Andreas Krebs , Klaus-Jörn Lange

We present a general result about generating group topologies by pseudo-norms. Namely, we show that if a topology has a base of sets which are closed in a certain sense, then it can be generated by a collection of pseudo-norms such that the…

Functional Analysis · Mathematics 2024-10-25 Eugene Bilokopytov

We consider various decision problems for automatic semigroups, which involve the provision of an automatic structure as part of the problem instance. With mild restrictions on the automatic structure, which seem to be necessary to make the…

Rings and Algebras · Mathematics 2007-05-23 Mark Kambites , Friedrich Otto

We prove the existence of a regular semigroup F(X) weakly generated by X such that all other regular semigroups weakly generated by X are homomorphic images of F(X). The semigroup F(X) is introduced by a presentation and the word problem…

Group Theory · Mathematics 2023-06-29 Luís Oliveira

We study a standard operator on classes of languages: unambiguous polynomial closure. We prove that for every class C of regular languages satisfying mild properties, the membership problem for its unambiguous polynomial closure UPol(C)…

Formal Languages and Automata Theory · Computer Science 2024-02-14 Thomas Place , Marc Zeitoun

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.…

Formal Languages and Automata Theory · Computer Science 2009-10-26 Thomas Ang , Giovanni Pighizzini , Narad Rampersad , Jeffrey Shallit

We investigate the polynomial closure operation (C -> Pol(C)) defined on classes of regular languages. We present an interesting and useful connection relating the separation problem for the class C and the membership problem for it…

Formal Languages and Automata Theory · Computer Science 2018-02-20 Thomas Place , Marc Zeitoun

We study subsets of groups and monoids defined by language-theoretic means, generalizing the classical approach to the word problem. We expand on results by Herbst from 1991 to a more general setting, and for a class of languages…

Group Theory · Mathematics 2025-04-01 André Carvalho , Carl-Fredrik Nyberg-Brodda

Regular synchronization languages can be used to define rational relations of finite words, and to characterize subclasses of rational relations, like automatic or recognizable relations. We provide a systematic study of the decidability of…

Formal Languages and Automata Theory · Computer Science 2024-02-14 Christof Löding , Sarah Winter

We study the problem of regular separability of languages of vector addition systems with states (VASS). It asks whether for two given VASS languages K and L, there exists a regular language R that includes K and is disjoint from L. While…

Formal Languages and Automata Theory · Computer Science 2020-07-02 Wojciech Czerwiński , Georg Zetzsche

Let $\mathcal{P}(\Sigma^*)$ be the semiring of languages, and consider its subset $\mathcal{P}(\Sigma)$. In this paper we define the language recognized by a weighted automaton over $\mathcal{P}(\Sigma)$ and a one-letter alphabet.…

Formal Languages and Automata Theory · Computer Science 2010-07-27 Edoardo Carta-Gerardino , Parisa Babaali

A finite group $G$ is called uniformly semi-rational if there exists an integer $r$ such that the generators of every cyclic sugroup $\langle x \rangle$ of $G$ lie in at most two conjugacy classes, namely $x^G$ or $(x^r)^G$. In this paper,…

Group Theory · Mathematics 2024-10-16 Marco Vergani

We prove that, given a finitely generated subgroup $H$ of a free group $F$, the following questions are decidable: is $H$ closed (dense) in $F$ for the pro-(met)abelian topology? is the closure of $H$ in $F$ for the pro-(met)abelian…

Group Theory · Mathematics 2023-05-25 Claude Marion , Pedro V. Silva , Gareth Tracey

In this paper we characterize the congruence associated to the direct sum of all irreducible representations of a finite semigroup over an arbitrary field, generalizing results of Rhodes for the field of complex numbers. Applications are…

Group Theory · Mathematics 2014-11-25 Jorge Almeida , Stuart Margolis , Benjamin Steinberg , Mikhail Volkov

We study locally compact group topologies on semisimple Lie groups. We show that the Lie group topology on such a group $S$ is very rigid: every 'abstract' isomorphism between $S$ and a locally compact and $\sigma$-compact group $\Gamma$ is…

Group Theory · Mathematics 2011-08-09 Linus Kramer

Let $F$ be a free group of arbitrary rank and let $H$ be a finitely generated subgroup of $F$. Given a pseudovariety $\mathbf{V}$ of finite groups, i.e. a class of finite groups closed under taking subgroups, quotients and finitary direct…

Group Theory · Mathematics 2023-05-30 Claude Marion , Pedro V. Silva , Gareth Tracey