Unique Normalization for Shallow TRS (Q3636819)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Unique Normalization for Shallow TRS	scientific article

Statements

scholarly article

0 references

Unique Normalization for Shallow TRS (English)

0 references

0 references

Florent Jacquemard

0 references

Rewriting Techniques and Applications

0 references

publication date

30 June 2009

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/978-3-642-02348-4_5

0 references

Term Rewriting and All That

0 references

Ground reducibility is EXPTIME-complete

0 references

Undecidable properties of flat term rewrite systems

0 references

Termination of Rewriting with Right-Flat Rules

0 references

On the Normalization and Unique Normalization Properties of Term Rewrite Systems

0 references

Automated Reasoning

0 references

Computer Science Logic

0 references

Reachability and confluence are undecidable for flat term rewriting systems

0 references

The Confluence Problem for Flat TRSs

0 references

Decidability for left-linear growing term rewriting systems.

0 references

Deterministic tree pushdown automata and monadic tree rewriting systems

0 references

0 references

0 references

A new decidability technique for ground term rewriting systems with applications

0 references

A polynomial algorithm for uniqueness of normal forms of linear shallow term rewrite systems

0 references

Decidability of Termination for Semi-constructor TRSs, Left-Linear Shallow TRSs and Related Systems

0 references

Identifiers

zbMATH Open document ID

0 references

10.1007/978-3-642-02348-4_5

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:3636819

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3636819&oldid=35115214"