Efficiency issues in the KBMAG procedure

DOI10.1016/j.jlap.2010.11.001zbMath1227.68116OpenAlexW2026226239MaRDI QIDQ649584

Jerry Swan

Publication date: 2 December 2011

Published in: The Journal of Logic and Algebraic Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jlap.2010.11.001

zbMATH Keywords

string rewritingautomatic groupsKnuth-Bendix algorithmsoftware package \textsc{Kbmag}

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Software, source code, etc. for problems pertaining to group theory (20-04)

Uses Software

• kbmag
• MAF

Cites Work

• On updating suffix tree labels
• The use of Knuth-Bendix methods to solve the word problem in automatic groups
• On-line construction of suffix trees
• On theories with a combinatorial definition of 'equivalence'
• Algorithms on Strings, Trees and Sequences
• Opal: A system for computing noncommutative gröbner bases
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Efficiency issues in the KBMAG procedure