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

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 Schutzenberger's theorems. The technical report [12] that this extended abstract is based on contains complete proofs and can be accessed at the net.

[1]  Jean Berstel,et al.  Rational series and their languages , 1988, EATCS monographs on theoretical computer science.

[2]  Dietrich Kuske,et al.  Branching automata with costs - a way of reflecting parallelism in costs star , 2004, Theor. Comput. Sci..

[3]  Arto Salomaa,et al.  Semirings, Automata, Languages , 1985, EATCS Monographs on Theoretical Computer Science.

[4]  Arto Salomaa,et al.  Automata-Theoretic Aspects of Formal Power Series , 1978, Texts and Monographs in Computer Science.

[5]  S C Kleene,et al.  Representation of Events in Nerve Nets and Finite Automata , 1951 .

[6]  Dietrich Kuske,et al.  Towards a language theory for infinite N-free pomsets , 2003, Theor. Comput. Sci..

[7]  Arto Salomaa,et al.  Semirings, Automata and Languages , 1985 .

[8]  J. Grabowski,et al.  On partial languages , 1981, Fundam. Informaticae.

[9]  Manfred Droste,et al.  A Kleene Theorem for Weighted Tree Automata , 2004, Theory of Computing Systems.

[10]  Christian Pech.  Kleene's Theorem for Weighted Tree-Automata , 2003, FCT.

[11]  Pascal Weil,et al.  Series-parallel languages and the bounded-width property , 2000, Theor. Comput. Sci..

[12]  Paul Gastin,et al.  The Kleene-Schützenberger Theorem for Formal Power Series in Partially Commuting Variables , 1999, Inf. Comput..

[13]  Jay L. Gischer,et al.  The Equational Theory of Pomsets , 1988, Theor. Comput. Sci..

[14]  Pascal Weil,et al.  Rationality in Algebras with a Series Operation , 2002, Inf. Comput..

[15]  Marcel Paul Schützenberger,et al.  On the Definition of a Family of Automata , 1961, Inf. Control..

[16]  Jean Berstel,et al.  Recognizable Formal Power Series on Trees , 1982, Theor. Comput. Sci..

[17]  Werner Kuich.  Formal Power Series over Trees , 1997, Developments in Language Theory.