Branching automata with costs—a way of reflecting parallelism in costs★
D Kuske, I Meinecke - Theoretical Computer Science, 2004 - Elsevier
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.
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.
Branching automata with costs—a way of reflecting parallelism in costs
D Kuske, I Meinecke - … Conference on Implementation and Application of …, 2003 - Springer
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.
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.
Showing the best results for this search. See all results