Welcome!
To use the personalized features of this site, please log in or register.
If you have forgotten your username or password, we can help.
My Menu
Saved Items

Branching Automata with Costs — A Way of Reflecting Parallelism in Costs

Dietrich KuskeContact Information and Ingmar MeineckeContact Information

(6)  Institut für Algebra, Technische Universität Dresden, D-01062 Dresden, Germany
Abstract
Extending work by Lodaya and Weil, we propose a model of branching automata with costs in which the calculation of the cost of a parallel composition is handled differently from the calculation of the cost of a sequential composition. Our main result characterizes the behavior of these automata in the spirit of Kleene’s and Schützenberger’s theorems.
The technical report [12] that this extended abstract is based on contains complete proofs and can be accessed at the net.

Contact Information Dietrich Kuske
Email: kuske@math.tu-dresden.de

Contact Information Ingmar Meinecke
Email: meinecke@math.tu-dresden.de
Fulltext Preview (Small, Large)
Image of the first page of the fulltext

References secured to subscribers.



Export this chapter
Export this chapter as RIS | Text
 
Remote Address: 38.107.191.108 • Server: mpweb08
HTTP User Agent: CCBot/1.0 (+http://www.commoncrawl.org/bot.html)