The reachability and related decision problems for monadic and semi-constructor TRSs (Q844204): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Reachability and confluence are undecidable for flat term rewriting systems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Rewriting Techniques and Applications / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q2730723 / rank | |||
Normal rank | |||
Latest revision as of 09:00, 2 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The reachability and related decision problems for monadic and semi-constructor TRSs |
scientific article |
Statements
The reachability and related decision problems for monadic and semi-constructor TRSs (English)
0 references
18 January 2010
0 references
theory of computation
0 references
term rewriting systems
0 references
