Direct and dual laws for automata with multiplicities
classification
🧮 math.CO
cs.DMcs.SC
keywords
lawsautomatadualmultiplicitiesalmostamultcalledcharacterize
read the original abstract
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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.