Decidable first-order theories of one-step rewriting in trace monoids

DOI10.1007/s00224-004-1099-9zbMath1061.68086OpenAlexW1985537797MaRDI QIDQ1764424

Markus Lohrey, Dietrich Kuske

Publication date: 24 February 2005

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00224-004-1099-9

zbMATH Keywords

decidabilitysemi-Thue systems

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Grammars and rewriting systems (68Q42)

Related Items (max. 100)

An optimal construction of Hanf sentences

This page was built for publication: Decidable first-order theories of one-step rewriting in trace monoids