Direct and dual laws for automata with multiplicities

Authors:
G. Duchamp;M. Flouret;É. Laugerotte;J.-G. Luque
Affiliations:
LIFAR, Mont-Saint-Aignan Cedex, France;LIFAR, Mont-Saint-Aignan Cedex, France;LIFAR, Mont-Saint-Aignan Cedex, France;LIFAR, Mont-Saint-Aignan Cedex, France
Venue:
Theoretical Computer Science
Year:
2001

Citing 13
Cited 8

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
AUTOMATE, a computing package for automata and finite semigroups

Journal of Symbolic Computation
Grail: a C++ library for automata and expressions

Journal of Symbolic Computation - Special issue on “algorithms: implementation, libraries and use”
Noncommutative minimization algorithms

Information Processing Letters
Automata, Languages, and Machines

Automata, Languages, and Machines
Introduction To Automata Theory, Languages, And Computation

Introduction To Automata Theory, Languages, And Computation
Automata: Theoretic Aspects of Formal Power Series

Automata: Theoretic Aspects of Formal Power Series
Traces, Histories, Graphs: Instances of a Process Monoid

Proceedings of the Mathematical Foundations of Computer Science 1984
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
SEA: A Symbolic Environment for Automata Theory

WIA '99 Revised Papers from the 4th International Workshop on Automata Implementation

Brzozowski's Derivatives Extended to Multiplicities

CIAA '01 Revised Papers from the 6th International Conference on Implementation and Application of Automata
Derivatives of rational expressions and related theorems

Theoretical Computer Science - Implementation and application automata
Scheduling hard sporadic tasks with regular languages and generating functions

Theoretical Computer Science - Implementation and application automata
WeightedWord Recognition

Fundamenta Informaticae
Some algebraic properties of measure-once two-way quantum finite automata

Quantum Information Processing
A Bialgebraic Approach to Automata and Formal Language Theory

LFCS '09 Proceedings of the 2009 International Symposium on Logical Foundations of Computer Science
WeightedWord Recognition

Fundamenta Informaticae
Computing weights

CIAA'13 Proceedings of the 18th international conference on Implementation and Application of Automata

Quantified Score

Hi-index	5.23

Visualization

Abstract

We present here theoretical results coming from the implementation of the package called AMULT (automata with multiplicities). We show that classical formulas are optimal for the bounds. Especially they are almost everywhere optimal for the fields R and C. We characterize the dual laws preserving rationality and examine compatibility between the geometry of the K-automata andthese laws. Copyright 2001 Elsevier Science B.V.