Rational Languages and the Burnside Problem
نویسندگان
چکیده
The problem of finding regularity conditions for languages is, via the syntactic monoid, closely related to the classical Burnside problem. This survey paper presents several results and conjectures in this direction as well as on related subjects, including bounded languages, pumping, square-free words, commutativity, and rational power series.
منابع مشابه
Desert Automata I. A Burnside Problem and its Solution
We introduce a new model of weighted automata: the desert automata. We show the decidability of the limitedness problem for desert automata by solving the underlying Burnside problem. As an application of this result, we give a positive solution to the so-called finite substitution problem which was open for more than 10 years: given recognizable languages K and L, decide whether there exists a...
متن کاملResiduated Lattices, Regular Languages, and Burnside Problem
In this talk we are going to explore an interesting connection between the famous Burnside problem for groups, regular languages, and residuated lattices. Let K be a finitely axiomatized class of residuated lattices. Recall that the usual way of proving decidability of universal theory for K is to establish that K has the finite embeddability property (FEP) [2, 3]. It turns out that the method ...
متن کاملDesert Automata and the Finite Substitution Problem ⋆ ( Extended Abstract ) ⋆ ⋆ Daniel
We give a positive solution to the so-called finite substitution problem which was open for more than 10 years [11]: given recognizable languages K and L, decide whether there exists a finite substitution σ such that σ(K) = L. For this, we introduce a new model of weighted automata and show the decidability of its limitedness problem by solving the underlying Burnside problem.
متن کاملTornehave morphisms III: the reduced Tornehave morphism and the Burnside unit functor
We shall show that a morphism anticipated by Tornehave induces (and helps to explain) Bouc’s isomorphism relating a quotient of the Burnside unit functor (measuring a difference between real and rational representations of finite 2-groups) and a quotient of the kernel of linearization (measuring a difference between rhetorical and rational 2-biset functors). 2000 Mathematics Subject Classificat...
متن کاملThe two generator restricted Burnside group of exponent five
In 1902 Burnside [4] wrote "A still undecided point in the theory of discontinuous groups is whether the order of a group may be not finite while the order of every operation it contains is finite". This leads to the following problem, now called the Burnside problem: "If a group is finitely generated and of finite exponent, is it finite?" This is a very difficult question so a weaker form know...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Theor. Comput. Sci.
دوره 40 شماره
صفحات -
تاریخ انتشار 1985