Semi-Thue systems with an inhibitor

DOI10.1023/A:1010759024900zbMath0981.68073MaRDI QIDQ5947359

Robert McNaughton

Publication date: 16 October 2001

Published in: Journal of Automated Reasoning (Search for Journal in Brave)

zbMATH Keywords

semi-Thue systemuniform termination problem

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Related Items (7)

On rationally controlled one-rule insertion systems ⋮ Termination proofs for string rewriting systems via inverse match-bounds ⋮ A canonical automaton for one-rule length-preserving string rewrite systems ⋮ Match-bounded string rewriting systems ⋮ Decision problems for semi-Thue systems with a few rules ⋮ Non-Looping String Rewriting ⋮ On prefixal one-rule string rewrite systems

This page was built for publication: Semi-Thue systems with an inhibitor