Using string-rewriting for solving the word problem for finitely presented groups (Q580494): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(4 intermediate revisions by 4 users not shown) | |||
Property / review text | |||
It is shown that the word problem for the group \(<\{a,b\}\), \(abba=1>\) can be solved through the technique of string-rewriting. The time complexity of the algorithm is given. | |||
Property / review text: It is shown that the word problem for the group \(<\{a,b\}\), \(abba=1>\) can be solved through the technique of string-rewriting. The time complexity of the algorithm is given. / rank | |||
Normal rank | |||
Property / reviewed by | |||
Property / reviewed by: M.Pałasiński / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 20F10 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 20M05 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 20M35 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 4017172 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
monoid presentation | |||
Property / zbMATH Keywords: monoid presentation / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
word problem | |||
Property / zbMATH Keywords: word problem / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
string-rewriting | |||
Property / zbMATH Keywords: string-rewriting / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
complexity | |||
Property / zbMATH Keywords: complexity / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
algorithm | |||
Property / zbMATH Keywords: algorithm / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/0020-0190(87)90149-9 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2056285149 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Confluent and Other Types of Thue Systems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3677188 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3714064 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A note on a special one-rule semi-Thue system / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4430312 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A finite Thue system with decidable word problem and without equivalent finite canonical system / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On deciding whether a monoid is a free monoid or is a group / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On deciding the confluence of a finite string-rewriting system on a given congruence class / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 12:20, 18 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Using string-rewriting for solving the word problem for finitely presented groups |
scientific article |
Statements
Using string-rewriting for solving the word problem for finitely presented groups (English)
0 references
1987
0 references
It is shown that the word problem for the group \(<\{a,b\}\), \(abba=1>\) can be solved through the technique of string-rewriting. The time complexity of the algorithm is given.
0 references
monoid presentation
0 references
word problem
0 references
string-rewriting
0 references
complexity
0 references
algorithm
0 references
0 references