Semirings, automata, languages
Semirings, automata, languages
Rational series and their languages
Rational series and their languages
The equivalence problem of multitape finite automata
Theoretical Computer Science
Noncommutative minimization algorithms
Information Processing Letters
Automata, Languages, and Machines
Automata, Languages, and Machines
Automata: Theoretic Aspects of Formal Power Series
Automata: Theoretic Aspects of Formal Power Series
Finite State Transformations of Images
ICALP '95 Proceedings of the 22nd International Colloquium on Automata, Languages and Programming
A Rational Design for a Weighted Finite-State Transducer Library
WIA '97 Revised Papers from the Second International Workshop on Implementing Automata
Autographe: A Graphical Version of Automate
WIA '98 Revised Papers from the Third International Workshop on Automata Implementation
SEA: A Symbolic Environment for Automata Theory
WIA '99 Revised Papers from the 4th International Workshop on Automata Implementation
Glushkov Construction for Multiplicities
CIAA '00 Revised Papers from the 5th International Conference on Implementation and Application of Automata
| Hi-index | 0.00 |
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 and characterize the dual laws preserving rationality.