No label defined (Q3341886)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3876579
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 3876579 |
Statements
1984
0 references
regular set
0 references
finitely presented group
0 references
finitely generated group
0 references
rational subsets
0 references
word problem
0 references
algorithm
0 references
free group
0 references
monadic group
0 references
0.8280039429664612
0 references
0.8187044858932495
0 references
0.8145540356636047
0 references
0.8095598816871643
0 references
0.7883449196815491
0 references
[For the entire collection see Zbl 0539.00015.] This article starts with the observation that if G is a finitely generated group such that the cardinality of any rational (i.e. regular) subset of G can be computed and such that for any two rational subsets R,S of G, \(R\subseteq S\) is decidable, then the word problem for G, the occurrence problem, and various other problems can be solved in a uniform way. An algorithm proposed by Charles Sims for computation in a free group is reformulated to solve the cardinality and inclusion problems for rational subsets of G when G is a monadic group, and an example indicates that the algorithm may be useful in other cases too. A similar treatment of monadic groups was given previously by \textit{R. V. Book} [Lect. Notes Comput. Sci. 138, 360-368 (1982; Zbl 0535.68011)].
0 references