Some polynomial-time algorithms for finite monadic Church-Rosser Thue systems (Q1123619): Difference between revisions

From MaRDI portal
Added link to MaRDI 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 / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0304-3975(89)90167-9 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1979249711 / 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: Decidable sentences of Church-Rosser congruences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3677188 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Thue systems as rewriting systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Presentations of groups and monoids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5592246 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Knuth-Bendix Completion Procedure and Thue Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The equation \(a_ M=b^ Nc^ P\) in a free group / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cancellativity in finitely presented semigroups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity results on the conjugacy problem for monoids / rank
 
Normal rank
Property / cites work
 
Property / cites work: The problems of cyclic equality and conjugacy for finite complete rewriting systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Elements of finite order for finite weight-reducing and confluent Thue systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The uniform conjugacy problem for finite church—Rosser thue systems is NP-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conjugacy in monoids with a special Church-Rosser presentation is decidable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Elements of Finite Order for Finite Monadic Church-Rosser Thue Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On two problems related to cancellativity / rank
 
Normal rank

Latest revision as of 09:09, 20 June 2024

scientific article
Language Label Description Also known as
English
Some polynomial-time algorithms for finite monadic Church-Rosser Thue systems
scientific article

    Statements

    Some polynomial-time algorithms for finite monadic Church-Rosser Thue systems (English)
    0 references
    0 references
    0 references
    1989
    0 references
    finite monadic Church-Rosser Thue systems
    0 references
    rewriting systems
    0 references
    uniform decision problems
    0 references
    uniform conjugacy problem
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references