A complete characterization of termination of \(0^p1^q\to 1^r0^s\)
From MaRDI portal
Publication:1583881
DOI10.1007/s002009900019zbMath0962.68086OpenAlexW2171901785MaRDI QIDQ1583881
Publication date: 30 October 2000
Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s002009900019
Related Items (7)
Termination proofs for string rewriting systems via inverse match-bounds ⋮ A canonical automaton for one-rule length-preserving string rewrite systems ⋮ Theorem proving with group presentations: Examples and questions ⋮ Match-bounded string rewriting systems ⋮ Decision problems for semi-Thue systems with a few rules ⋮ FINDING FINITE AUTOMATA THAT CERTIFY TERMINATION OF STRING REWRITING SYSTEMS ⋮ Automatic Termination
This page was built for publication: A complete characterization of termination of \(0^p1^q\to 1^r0^s\)
