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

  • Dietrich Kuske
  • Ingmar Meinecke
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2759)


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.


Matched Pair Formal Power Series Sequential Product Sequential Transition Sequential Composition 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    J. Berstel and C. Reutenauer. Recognizable formal power series on trees. Theoret. Comp. Sc., 18:115–148, 1982.zbMATHCrossRefMathSciNetGoogle Scholar
  2. [2]
    J. Berstel and C. Reutenauer. Rational Series and Their Languages, volume 12 of EATCS Monographs on Theoret. Comp. Sc. Springer, 1988.Google Scholar
  3. [3]
    M. Droste and P. Gastin. The Kleene-Schützenberger theorem for formal power series in partially commuting variables. Information and Computation, 153:47–80, 1999.zbMATHCrossRefMathSciNetGoogle Scholar
  4. [4]
    M. Droste and D. Kuske. Skew and infinitary formal power series. In ICALP 2003, Lecture Notes in Computer Science. Springer, 2003. Accepted.Google Scholar
  5. [5]
    M. Droste and H. Vogler. A Kleene theorem for weighted tree automata. Technical Report TUD-FI02-04, TU Dresden, June 2002.Google Scholar
  6. [6]
    J. L. Gischer. The equational theory of pomsets. Theoret. Comp. Sc., 61:199–224, 1988.CrossRefMathSciNetzbMATHGoogle Scholar
  7. [7]
    J. Grabowski. On partial languages. Ann. Soc. Math. Pol. IV: Fund. Math., 4(2):427–498, 1981.zbMATHMathSciNetGoogle Scholar
  8. [8]
    S.E. Kleene. Representations of events in nerve nets and finite automata. In C.E. Shannon and J. McCarthy, editors, Automata Studies, pages 3–42. Princeton University Press, 1956.Google Scholar
  9. [9]
    W. Kuich. Formal power series over trees. In Proc. of the 3rd International Conference Developments in Language Theory, pages 60–101. Aristotle University of Thessaloniki, 1997.Google Scholar
  10. [10]
    W. Kuich and A. Salomaa. Semirings, Automata, Languages, volume 5 of EATCS Monographs on Theoret. Comp. Sc. Springer, 1986.Google Scholar
  11. [11]
    D. Kuske. Towards a language theory for infinite N-free pomsets. Theoret. Comp. Sc., 299:347–386, 2003.zbMATHCrossRefMathSciNetGoogle Scholar
  12. [12]
    D. Kuske and I. Meinecke. Branching automata with costs-a way of reflecting parallelism in costs. Technical Report MATH-AL-4-2003, TU Dresden, March 2003. see Scholar
  13. [13]
    K. Lodaya and P. Weil. Series-parallel languages and the bounded-width property. Theoret. Comp. Sc., 237:347–380, 2000.zbMATHCrossRefMathSciNetGoogle Scholar
  14. [14]
    K. Lodaya and P. Weil. Rationality in algebras with a series operation. Information and Computation, 171:269–293, 2001.zbMATHCrossRefMathSciNetGoogle Scholar
  15. [15]
    Ch. Pech. Kleene’s theorem for weighted tree automata. In 14th International Symposium on Fundamentals of Computation Theory (FCT 2003), Lecture Notes in Computer Science. Springer, 2003. Accepted.Google Scholar
  16. [16]
    A. Salomaa and M. Soittola. Automata-Theoretic Aspects of Formal Power Series. Texts and Monographs in Computer Science. Springer, 1978.Google Scholar
  17. [17]
    M.P. Schützenberger. On the definition of a family of automata. Information and Control, 4:245–270, 1961.zbMATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Dietrich Kuske
    • 1
  • Ingmar Meinecke
    • 1
  1. 1.Institut für AlgebraTechnische Universität DresdenDresdenGermany

Personalised recommendations