Results 1  10
of
868
On the rational subset problem for groups
, 2007
"... We use language theory to study the rational subset problem for groups and monoids. We show that the decidability of this problem is preserved under graph of groups constructions with finite edge groups. In particular, it passes through free products amalgamated over finite subgroups and HNN exten ..."
Abstract

Cited by 14 (10 self)
 Add to MetaCart
We use language theory to study the rational subset problem for groups and monoids. We show that the decidability of this problem is preserved under graph of groups constructions with finite edge groups. In particular, it passes through free products amalgamated over finite subgroups and HNN
Rational subsets of partially reversible monoids
"... A class of monoids that can model partial reversibility allowing simultaneously instances of twosided reversibility, onesided reversibility and no reversibility is considered. Some of the basic decidability problems involving their rational subsets, syntactic congruences and characterization of re ..."
Abstract

Cited by 3 (3 self)
 Add to MetaCart
A class of monoids that can model partial reversibility allowing simultaneously instances of twosided reversibility, onesided reversibility and no reversibility is considered. Some of the basic decidability problems involving their rational subsets, syntactic congruences and characterization
Seperability of rational subsets by recognizable subsets . . .
, 2005
"... Given a direct product of monoids M = A ∗ × N m where A is finite and N is the additive monoid of nonnegative integers, the following problem is recursively decidable: given two rational subsests of M, does there exist a recognizable subset which includes one of the subsets and excludes the other. ..."
Abstract
 Add to MetaCart
Given a direct product of monoids M = A ∗ × N m where A is finite and N is the additive monoid of nonnegative integers, the following problem is recursively decidable: given two rational subsests of M, does there exist a recognizable subset which includes one of the subsets and excludes the other.
RATIONAL SUBSETS OF POLYCYCLIC MONOIDS AND VALENCE AUTOMATA
, 710
"... Abstract. We study the classes of languages defined by valence automata with rational target sets (or equivalently, regular valence grammars with rational target sets), where the valence monoid is drawn from the important class of polycyclic monoids. We show that for polycyclic monoids of rank 2 or ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
or more, such automata accept exactly the contextfree languages. For the polycyclic monoid of rank 1 (that is, the bicyclic monoid), they accept a class of languages strictly including the partially blind onecounter languages. Key to the proof is a description of the rational subsets of polycyclic
RATIONAL SUBSETS IN HNNEXTENSIONS AND AMALGAMATED PRODUCTS
"... Several transfer results for rational subsets and finitely generated subgroups of HNNextensions G = 〈H, t; t −1 at = ϕ(a)(a ∈ A) 〉 and amalgamated free products G = H ∗A J such that the associated subgroup A is finite. These transfer results allow to transfer decidability properties or structural pr ..."
Abstract

Cited by 4 (3 self)
 Add to MetaCart
Several transfer results for rational subsets and finitely generated subgroups of HNNextensions G = 〈H, t; t −1 at = ϕ(a)(a ∈ A) 〉 and amalgamated free products G = H ∗A J such that the associated subgroup A is finite. These transfer results allow to transfer decidability properties or structural
Results 1  10
of
868