Name
Abstract | ||
|---|---|---|
It is proved that for rational free abelian group languages recognizability is decidable and the corresponding syntactic congruences are also decidable. Other results focus the problem of relating closure results and decidability problems involving rational/recognizable languages in a (finitely generated) group H and a finite extension G of H . As a consequence of these results, generalizations to rational languages of any finitely generated abelian group are obtained, as well as alternative... |
Year | Venue | Keywords |
|---|---|---|
2002 | Bulletin of the EATCS | abelian group |
Field | DocType | Volume |
Abelian group,Discrete mathematics,Free abelian group,Abelian extension,Elementary abelian group,G-module,Pure mathematics,Solvable group,Non-abelian group,Rank of an abelian group,Mathematics | Journal | 77 |
Citations | PageRank | References |
2 | 0.67 | 1 |
Authors | ||
1 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Pedro V. Silva | 1 | 141 | 29.42 |