Termination of cycle rewriting

DOI10.1007/978-3-319-08918-8_33MaRDI QIDQ5170838zbMATH OpenOpenAlexFDO

Authors Barbara König, H. J. Sander Bruggink, Hans Zantema

Publication date 24 July 2014

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-08918-8_33

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Recommendations

• Transforming cycle rewriting into string rewriting
• Termination of cycle rewriting by transformation and matrix interpretation
• Termination of String Rewriting with Matrix Interpretations
• On termination of confluent one-rule string-rewriting systems
• Non-Looping String Rewriting

Cited in

(9)

• Endofunctions of given cycle type.
• Proving termination of graph transformation systems using weighted type graphs over semirings
• Termination of cycle rewriting by transformation and matrix interpretation
• Efficient completion of weighted automata
• Towards a qualitative reasoning on shape change and object division
• Transforming cycle rewriting into string rewriting
• Termination of graph transformation systems using weighted subgraph counting
• Termination of graph transformation systems using weighted subgraph counting
• Adding constants to string rewriting

This page was built for publication: Termination of cycle rewriting

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5170838)