Non-Looping String Rewriting (Q4718895): Difference between revisions

From MaRDI portal

Jump to:navigation, search

Latest revision as of 11:46, 29 May 2024

scientific article; zbMATH DE number 1382912

Language	Label	Description	Also known as
English	Non-Looping String Rewriting	scientific article; zbMATH DE number 1382912

Statements

scholarly article

0 references

Non-Looping String Rewriting (English)

0 references

zbMATH Open document ID

0 references

10.1051/ita:1999118

0 references

0 references

0 references

RAIRO - Theoretical Informatics and Applications

0 references

publication date

4 January 2000

0 references

full work available at URL

https://eudml.org/doc/222096

0 references

https://semanticscholar.org/paper/4562eb1767e4fd93120439497a5ba8cbca12b0a4

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

zbMATH Keywords

string rewriting reductions

0 references

loops

0 references

MaRDI profile type

MaRDI publication profile

0 references

0 references

Problems of equality and divisibility in semigroups with a single defining relation

0 references

0 references

Termination of rewriting

0 references

Natural termination

0 references

On Proving Uniform Termination and Restricted Termination of Rewriting Systems

0 references

0 references

Termination and derivational complexity of confluent one-rule string-rewriting systems

0 references

0 references

One-rule semi-Thue systems with loops of length one, two or three

0 references

Semi-Thue systems with an inhibitor

0 references

The undecidability of self-embedding for finite semi-Thue and Thue systems

0 references

Tree-Manipulating Systems and Church-Rosser Theorems

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:4718895

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