Rational series and their languages
Rational series and their languages
Models of a K-rational identity system
Journal of Computer and System Sciences
Partial derivatives of regular expressions and finite automaton constructions
Theoretical Computer Science
Handbook of formal languages, vol. 1
Derivatives of Regular Expressions
Journal of the ACM (JACM)
Direct and dual laws for automata with multiplicities
Theoretical Computer Science
Automata, Languages, and Machines
Automata, Languages, and Machines
Theory of Codes
Automata: Theoretic Aspects of Formal Power Series
Automata: Theoretic Aspects of Formal Power Series
Canonical derivatives, partial derivatives and finite automaton constructions
Theoretical Computer Science
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
New Finite Automaton Constructions Based on Canonical Derivatives
CIAA '00 Revised Papers from the 5th International Conference on Implementation and Application of Automata
From Mirkin's Prebases to Antimirov's Word Partial Derivatives
Fundamenta Informaticae
Derivatives of rational expressions with multiplicity
Theoretical Computer Science
Average complexity of Moore's and Hopcroft's algorithms
Theoretical Computer Science
| Hi-index | 0.00 |
Our aim is to study the set of K-rational expressions describing rational series. More precisely we are concerned with the definition of quotients of this set by coarser and coarser congruences which lead to an extension - in the case of multiplicities - of some classical results stated in the Boolean case. In particular, analogues of the well known theorems of Brzozowski and Antimirov are provided in this frame.