Decidable sentences for context-free groups

DOI10.1007/BFB0020796MaRDI QIDQ4035666zbMATH OpenFDO

Authors Klaus Madlener, Friedrich Otto

Publication date 18 May 1993

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BFB0020796

zbMATH Keywords

finitely generated context-free groupslinear sentences

Mathematics Subject Classification ID

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

Recommendations

• Some undecidability results for weakly confluent monadic string-rewriting systems
• About the descriptive power of certain classes of finite string-rewriting systems
• scientific article; zbMATH DE number 1263366
• Prefix-rewriting on context-free groups
• Undecidability results for monoids with linear-time decidable word problems

Cited in

(4)

• Computing presentations for subgroups of polycyclic groups and of context-free groups
• Codes modulo finite monadic string-rewriting systems
• On the rational subsets of the free group
• Mathematical Foundations of Computer Science 2003

This page was built for publication: Decidable sentences for context-free groups

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4035666)