Innermost Reachability and Context Sensitive Reachability Properties Are Decidable for Linear Right-Shallow Term Rewriting Systems (Q3522018): Difference between revisions

Latest revision as of 14:35, 28 June 2024

scientific article

Language	Label	Description	Also known as
English	Innermost Reachability and Context Sensitive Reachability Properties Are Decidable for Linear Right-Shallow Term Rewriting Systems	scientific article

Statements

instance of

scholarly article

0 references

title

Innermost Reachability and Context Sensitive Reachability Properties Are Decidable for Linear Right-Shallow Term Rewriting Systems (English)

0 references

0 references

0 references

Rewriting Techniques and Applications

0 references

publication date

28 August 2008

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/978-3-540-70590-1_13

0 references

cites work

Encompassment properties and automata with constraints

0 references

Q4705604

0 references

Bottom-Up Rewriting Is Inverse Recognizability Preserving

0 references

Q4847003

0 references

Innermost-Reachability and Innermost-Joinability Are Decidable for Shallow Term Rewrite Systems

0 references

Decidable approximations of term rewriting systems

0 references

Reachability and confluence are undecidable for flat term rewriting systems

0 references

Q4259966

0 references

The Confluence Problem for Flat TRSs

0 references

Q4938609

0 references

Q2723905

0 references

Identifiers

zbMATH Open document ID

1145.68449

0 references

DOI

10.1007/978-3-540-70590-1_13

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:3522018

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/978-3-540-70590-1_13
+Normal rank
@@ Property / OpenAlex ID @@
+W1819637175
@@ Property / OpenAlex ID: W1819637175 / rank @@
+Normal rank
@@ Property / cites work @@
+Encompassment properties and automata with constraints
+Normal rank
@@ Property / cites work @@
+Q4705604
@@ Property / cites work: Q4705604 / rank @@
+Normal rank
@@ Property / cites work @@
+Bottom-Up Rewriting Is Inverse Recognizability Preserving
+Normal rank
@@ Property / cites work @@
+Q4847003
@@ Property / cites work: Q4847003 / rank @@
+Normal rank
@@ Property / cites work @@
+Innermost-Reachability and Innermost-Joinability Are Decidable for Shallow Term Rewrite Systems
+Normal rank
@@ Property / cites work @@
+Decidable approximations of term rewriting systems
+Normal rank
@@ Property / cites work @@
+Reachability and confluence are undecidable for flat term rewriting systems
+Normal rank
@@ Property / cites work @@
+Q4259966
@@ Property / cites work: Q4259966 / rank @@
+Normal rank
@@ Property / cites work @@
+The Confluence Problem for Flat TRSs
@@ Property / cites work: The Confluence Problem for Flat TRSs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4938609
@@ Property / cites work: Q4938609 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2723905
@@ Property / cites work: Q2723905 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:3522018