Cycle-Free Finite Automata in Partial Iterative Semirings

Authors:
Stephen L. Bloom;Zoltan Ésik;Werner Kuich
Affiliations:
Dept. of Computer Science, Stevens Institute of Technology, Hoboken, USA;Dept. of Computer Science, University of Szeged, Hungary;Institut für Diskrete Mathematik und Geometrie, Technische Universität Wien, Austria
Venue:
CAI '09 Proceedings of the 3rd International Conference on Algebraic Informatics
Year:
2009

Citing 7
Cited 0

Iteration theories: the equational logic of iterative processes

Iteration theories: the equational logic of iterative processes
Semirings, Automata and Languages

Semirings, Automata and Languages
Kleene theorems for skew formal power series

Acta Cybernetica
Skew and infinitary formal power series

Theoretical Computer Science
Weighted automata with discounting

Information Processing Letters
Partial Conway and Iteration Semirings

Fundamenta Informaticae
Handbook of Weighted Automata

Handbook of Weighted Automata

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider partial Conway semirings and partial iteration semirings, both introduced by Bloom, Ésik, Kuich [2]. We develop a theory of cycle-free elements in partial iterative semirings that allows us to define cycle-free finite automata in partial iterative semirings and to prove a Kleene Theorem. We apply these results to power series over a graded monoid with discounting.