Computing the closure of sets of words under partial commutations (Q4645168): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Yves Métivier / rank
Normal rank
 
Property / author
 
Property / author: Yves Métivier / rank
 
Normal rank
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.1007/3-540-60084-1_64 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1581738459 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial problems of commutation and rearrangements / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3736919 / 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: Semigroups, Presburger formulas, and languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded Regular Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognizable closures and submonoids of free partially commutative monoids / rank
 
Normal rank
Property / cites work
 
Property / cites work: On recognizable subsets of free partially commutative monoids / rank
 
Normal rank
Property / cites work
 
Property / cites work: ON THE STAR OPERATION IN FREE PARTIALLY COMMUTATIVE MONOIDS / rank
 
Normal rank
Property / cites work
 
Property / cites work: On regular compatibility of semi-commutations / 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
links / mardi / namelinks / mardi / name
 

Latest revision as of 19:26, 17 July 2024

scientific article; zbMATH DE number 6999422
Language Label Description Also known as
English
Computing the closure of sets of words under partial commutations
scientific article; zbMATH DE number 6999422

    Statements

    Identifiers