\texttt{PSPACE}-complete problems for subgroups of free groups and inverse finite automata (Q1575552): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: The Nielsen reduction and P-complete problems in free groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of intersection and conjugacy problems in free groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time/Space Trade-Offs for Reversible Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3859267 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite-automaton aperiodicity is PSPACE-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040880 / rank
 
Normal rank
Property / cites work
 
Property / cites work: INVERSE MONOIDS OF DOT-DEPTH TWO / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4132170 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3862379 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Note on Bennett’s Time-Space Tradeoff for Reversible Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4145882 / rank
 
Normal rank
Property / cites work
 
Property / cites work: FREE INVERSE MONOIDS AND GRAPH IMMERSIONS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5641083 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3776657 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Problem on Rational Subsets of the Free Group / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4285784 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topology of finite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of some problems from the theory of automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: REFINING KNOWN RESULTS ON THE GENERALIZED WORD PROBLEM FOR FREE GROUPS / rank
 
Normal rank

Latest revision as of 13:12, 30 May 2024

scientific article
Language Label Description Also known as
English
\texttt{PSPACE}-complete problems for subgroups of free groups and inverse finite automata
scientific article

    Statements

    \texttt{PSPACE}-complete problems for subgroups of free groups and inverse finite automata (English)
    0 references
    21 August 2000
    0 references
    0 references
    0 references
    0 references
    0 references
    PSPACE-completeness
    0 references
    subgroups of the free group
    0 references
    inverse automata
    0 references
    pure subgroups
    0 references
    0 references
    0 references
    0 references
    0 references