Decidable sentences for context-free groups
The linear sentences of Book  are a class of logical formulae particularly well-suited for describing certain properties of Thue congruences. Here we show that the decidability of the set of valid linear sentences is an invariant property of finitely generated monoids. Further, we prove that for each finite monadic string-rewriting system R such that R presents a group, and R is confluent on
Unable to display preview. Download preview PDF.
- 3.R.V. Book ; Thue systems as rewriting systems; J. Symbolic Computation 3, 39–68.Google Scholar
- 5.J.E. Hopcroft, J.D. Ullman ; Introduction to automata theory, languages, and computation [Addison-Wesley, Reading, MA].Google Scholar
- 6.K. Madlener, F. Otto ; Communtativity in groups presented by finite Church-Rosser Thue systems; RAIRO Inf. Théorique et Appl. 22, 93–111.Google Scholar
- 10.F. Otto, L. Zhang ; Decision problems for finite special-string-rewriting systems that are confluent on some congruence class; Acta Informatica, to appear.Google Scholar