Word problems over traces which are solvable in linear time (Q914395): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Theory of traces / rank
 
Normal rank
Property / cites work
 
Property / cites work: New decision algorithms for finitely presented commutative semigroups / 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: Rewriting systems and word problems in a free partially commutative monoid / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ein algorithmisches Kriterium für die Lösbarkeit eines algebraischen Gleichungssystems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial problems of commutation and rearrangements / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partial commutations and faithful rational transductions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3736919 / 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: On the Knuth-Bendix completion for concurrent processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counter machines and counter languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Presentations of groups and monoids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semigroups, Presburger formulas, and languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of the word problems for commutative semigroups and polynomial ideals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4733400 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preperfectness is undecidable for Thue systems containing only length- reducing rules and a single commutation rule / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recursive Unsolvability of a problem of Thue / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5561959 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4294630 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The word problem for free partially commutative groups / rank
 
Normal rank

Latest revision as of 15:45, 20 June 2024

scientific article
Language Label Description Also known as
English
Word problems over traces which are solvable in linear time
scientific article

    Statements

    Word problems over traces which are solvable in linear time (English)
    0 references
    0 references
    1990
    0 references
    concurrent processes
    0 references
    word problems
    0 references
    trace replacement systems
    0 references
    cones
    0 references
    blocks
    0 references

    Identifiers

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