The word matching problem is undecidable for finite special string-rewriting systems that are confluent (Q4571993): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1007/3-540-63165-8_218 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1549267059 / rank | |||
Normal rank |
Revision as of 01:07, 20 March 2024
scientific article; zbMATH DE number 6898416
Language | Label | Description | Also known as |
---|---|---|---|
English | The word matching problem is undecidable for finite special string-rewriting systems that are confluent |
scientific article; zbMATH DE number 6898416 |
Statements
The word matching problem is undecidable for finite special string-rewriting systems that are confluent (English)
0 references
4 July 2018
0 references