REFINING KNOWN RESULTS ON THE GENERALIZED WORD PROBLEM FOR FREE GROUPS

DOI10.1142/S0218196792000141zbMath0741.68050OpenAlexW2048532387MaRDI QIDQ4711256

Iain A. Stewart

Publication date: 25 June 1992

Published in: International Journal of Algebra and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0218196792000141

zbMATH Keywords

generalized word problemcombinatorial group theorycomplete problemslogical characterization of complexity classes

Mathematics Subject Classification ID

Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (4)

On completeness for NP via projection translations ⋮ Methods for proving completeness via logical reductions ⋮ \texttt{PSPACE}-complete problems for subgroups of free groups and inverse finite automata ⋮ Context-sensitive transitive closure operators

This page was built for publication: REFINING KNOWN RESULTS ON THE GENERALIZED WORD PROBLEM FOR FREE GROUPS