论文信息 - Non-Termination of Cycle Rewriting by Finite Automata: Invited Presentation at the 9th International Workshop on Computing with Terms and Graphs - 字舞流文

Non-Termination of Cycle Rewriting by Finite Automata: Invited Presentation at the 9th International Workshop on Computing with Terms and Graphs

Jörg Endrullis

[1] Hans Zantema,et al. Non-looping string rewriting , 1999, RAIRO Theor. Informatics Appl..

[2] Armin Biere,et al. Effective Preprocessing in SAT Through Variable and Clause Elimination , 2005, SAT.

[3] Jan Willem Klop,et al. Dance of the Starlings , 2017 .

[4] Jürgen Giesl,et al. Proving Non-looping Non-termination Automatically , 2012, IJCAR.

[5] Jörg Endrullis,et al. Local Termination: theory and practice , 2010, Log. Methods Comput. Sci..

[6] Hans Zantema,et al. Degrees of Undecidability in Term Rewriting , 2009, CSL.

[7] Hans Zantema,et al. Proving non-termination by finite automata , 2015, RTA.