\texttt{PSPACE}-complete problems for subgroups of free groups and inverse finite automata
type: Item
instance of: scholarly article
title: \texttt{PSPACE}-complete problems for subgroups of free groups and inverse finite automata
zbMATH Open document ID: 0944.68100
DOI: 10.1016/S0304-3975(98)00225-4
published in: Theoretical Computer Science
publication date: 2000-08-21T00:00:00Z
Mathematics Subject Classification ID: 68Q17
Mathematics Subject Classification ID: 20E99
Mathematics Subject Classification ID: 68Q70
zbMATH DE Number: 1493361
zbMATH Keywords: PSPACE-completeness
zbMATH Keywords: subgroups of the free group
zbMATH Keywords: inverse automata
zbMATH Keywords: pure subgroups
author: J.-C. Birget
author: S. W. Margolis
author: J. C. Meakin
author: Pascal Weil
MaRDI profile type: Publication
cites work: The Nielsen reduction and P-complete problems in free groups
cites work: On the complexity of intersection and conjugacy problems in free groups
cites work: Time/Space Trade-Offs for Reversible Computation
cites work: Q3859267
cites work: Finite-automaton aperiodicity is PSPACE-complete
cites work: Q4040880
cites work: INVERSE MONOIDS OF DOT-DEPTH TWO
cites work: Q4132170
cites work: Q4198056
cites work: Q3862379
cites work: A Note on Bennett’s Time-Space Tradeoff for Reversible Computation
cites work: Q4145882
cites work: FREE INVERSE MONOIDS AND GRAPH IMMERSIONS
cites work: Q5641083
cites work: Q3776657
cites work: A Problem on Rational Subsets of the Free Group
cites work: Q4285784
cites work: Topology of finite graphs
cites work: Complexity of some problems from the theory of automata
cites work: REFINING KNOWN RESULTS ON THE GENERALIZED WORD PROBLEM FOR FREE GROUPS
description: scientific article; zbMATH DE number 1493361