Direct and dual laws for automata with multiplicities
type: Dataset
description: We present here theoretical results coming from the implementation of the package called AMULT (automata with multiplicities in several noncommutative variables). We show that classical formulas are ``almost every time'' optimal, characterize the dual laws preserving rationality and also relators that are compatible with these laws.
landing page: 0304-3975
keyword: automata-with-multiplicities
keyword: congruences
keyword: dual-laws
keyword: infoeu-reposemanticsarticle
keyword: infoinfo-dscomputer-science-csdata-structures-and-algorithms-csds
keyword: infoinfo-sccomputer-science-cssymbolic-computation-cssc
keyword: journal-articles
keyword: mathmath-comathematics-mathcombinatorics-mathco
keyword: rational-laws
keyword: shuffle-compatibility
issued: 2026-05-09T22:53:15.095963
modified: 2026-05-09T22:53:15.095968
language: en
contact point: Organization
  fn: CCSD

test_moissonnage_selune
type: Agent

Direct and dual laws for automata with multiplicities
type: Distribution
format: HTML
access URL: https://hal.science/hal-00085316
issued: 2026-05-09T22:53:15.103718
modified: 2026-05-09T22:53:15.086451