Complexity, combinatorial group theory and the language of palutators (Q1105698): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Groups and NTS languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3748486 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Groups Presented by Finite Two-Monadic Church-Rosser Thue Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite complete rewriting systems and the complexity of word problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Confluent and Other Types of Thue Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dehn's Algorithm and the Complexity of Word Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Thue systems as rewriting systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some two-generator one-relator non-Hopfian groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hierarchies of Computable groups and the word problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3311653 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3964552 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complete semi-Thue systems for abelian groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Commutative monoids have complete presentations by free (non-commutative) monoids / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of Dehn's algorithm for word problems in groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: The accessibility of finitely presented groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4055156 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3341886 / rank
 
Normal rank
Property / cites work
 
Property / cites work: One-tape, off-line Turing machine computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3862379 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Pattern Matching in Strings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3338229 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4145882 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Word Problems Solvable in Logspace / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pseudo-natural algorithms for the word problem for finitely presented monoids and groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3775714 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5513066 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Groups, the theory of ends, and context-free languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recursive unsolvability of group theoretic problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3697214 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Word problems and a homological finiteness condition for monoids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3026992 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4720786 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4085717 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3687751 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3962990 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3048248 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 18:06, 18 June 2024

scientific article
Language Label Description Also known as
English
Complexity, combinatorial group theory and the language of palutators
scientific article

    Statements

    Complexity, combinatorial group theory and the language of palutators (English)
    0 references
    0 references
    1988
    0 references
    0 references
    word problems
    0 references
    complexity
    0 references
    linear time
    0 references
    HNN extensions
    0 references
    languages
    0 references
    palutators
    0 references
    commutator
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references