Two techniques in the area of the star problem in trace monoids (Q1884907): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Trace languages defined by regular string languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3859267 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3763601 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial problems of commutation and rearrangements / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semi-commutations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mixed product and asynchronous automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4079524 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matrices de Hankel / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decidability of the star problem in \(A^*\times{}\{ b\}^*\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3086926 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded Regular Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semigroups, Presburger formulas, and languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Limitedness theorem on finite automata with distance functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved limitedness theorems on finite automata with distance functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4251054 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The star problem and the finite power property in trace monoids: Reductions beyond C4 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4938642 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decidability equivalence between the star problem and the finite power problem in trace monoids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kleene quotient theorems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Une condition suffisante de reconnaissabilité dans un monoïde partiellement commutatif / rank
 
Normal rank
Property / cites work
 
Property / cites work: New results on the star problem in trace monoids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5541339 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some trace monoids where both the Star problem and the Finite Power Property Problem are decidable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3741057 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On regular trace languages / rank
 
Normal rank

Latest revision as of 13:50, 7 June 2024

scientific article
Language Label Description Also known as
English
Two techniques in the area of the star problem in trace monoids
scientific article

    Statements

    Two techniques in the area of the star problem in trace monoids (English)
    0 references
    0 references
    0 references
    27 October 2004
    0 references
    Trace monoid
    0 references
    Recognizable language
    0 references
    Star problem
    0 references
    Decidability
    0 references

    Identifiers