Fair termination is decidable for ground systems (Q5055739): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/3-540-51081-8_126 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1546249478 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Tree generating regular systems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Decidability of the confluence of finite ground term rewrite systems and of other related term rewrite systems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Bottom-up and top-down tree transformations— a comparison / rank | |||
Normal rank | |||
Latest revision as of 02:57, 31 July 2024
scientific article; zbMATH DE number 7631134
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Fair termination is decidable for ground systems |
scientific article; zbMATH DE number 7631134 |
Statements
Fair termination is decidable for ground systems (English)
0 references
9 December 2022
0 references
