Automata, Languages, and Machines
Automata, Languages, and Machines
Semirings, Automata and Languages
Semirings, Automata and Languages
A Kleene/Büchi-like theorem for clock languages
Journal of Automata, Languages and Combinatorics - Selected papers of the workshop on logic and algebra for concurrency
Skew and infinitary formal power series
Theoretical Computer Science
Skew and infinitary formal power series
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Cycle-Free Finite Automata in Partial Iterative Semirings
CAI '09 Proceedings of the 3rd International Conference on Algebraic Informatics
| Hi-index | 0.00 |
We investigate the theory of skew (formal) power series introduced by Droste, Kuske [5, 6], if the basic semiring is a Conway semiring. This yields Kleene Theorems for skew power series, whose supports contain finite and infinite words. We then develop a theory of convergence in semirings of skew power series based on the discrete convergence. As an application this yields a Kleene Theorem proved already by Droste, Kuske [5].