Efficiency issues in the KBMAG procedure
From MaRDI portal
Publication:649584
DOI10.1016/j.jlap.2010.11.001zbMath1227.68116MaRDI QIDQ649584
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
68W30: Symbolic computation and algebraic computation
68Q45: Formal languages and automata
68Q42: Grammars and rewriting systems
20F10: Word problems, other decision problems, connections with logic and automata (group-theoretic aspects)
20-04: Software, source code, etc. for problems pertaining to group theory
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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