The undecidability of a word problem: On a conjecture of Strong, Maggiolo-Schettini and Rosen

DOI10.1016/0020-0190(81)90108-3zbMath0457.03036OpenAlexW2017856324WikidataQ122983527 ScholiaQ122983527MaRDI QIDQ1150608

Ronald V. Book

Publication date: 1981

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(81)90108-3

zbMATH Keywords

identification problem

Mathematics Subject Classification ID

Word problems, etc. in computability and recursion theory (03D40) General topics in the theory of software (68N01) Thue and Post systems, etc. (03D03)

Related Items (2)

Equivalences and transformations of regular systems - applications to recursive program schemes and grammars ⋮ Fundamental properties of infinite trees

Cites Work

• On the emptiness of the intersection of two DOS languages problem
• Monadic Thue systems
• Recursion Structure Simplification

This page was built for publication: The undecidability of a word problem: On a conjecture of Strong, Maggiolo-Schettini and Rosen