Paper Search Console

Home Search Page About Contact

Journal Title

Title of Journal: Theory Comput Syst

Search In Journal Title:

Abbravation: Theory of Computing Systems

Search In Journal Abbravation:

Publisher

Springer-Verlag

Search In Publisher:

DOI

10.1016/0014-4827(85)90128-4

Search In DOI:

ISSN

1433-0490

Search In ISSN:
Search In Title Of Papers:

A Kleene Theorem for Weighted Tree Automata over D

Authors: Zoltán Fülöp Andreas Maletti Heiko Vogler
Publish Date: 2007/10/24
Volume: 44, Issue: 3, Pages: 455-499
PDF Link

Abstract

Kleene’s theorem on the equivalence of recognizability and rationality for formal tree series over distributive multioperator monoids is proved As a consequence of this Kleene’s theorem for weighted tree automata over arbitrary ie not necessarily commutative semirings is derived

Keywords:

References

.
Search In Abstract Of Papers:
Other Papers In This Journal:
  1. Parameterized Complexity of Secluded Connectivity Problems
  2. Collusion in Atomic Splittable Routing Games
  3. Unidirectional Lambek Grammars in Polynomial Time
  4. The Deduction Theorem for Strong Propositional Proof Systems
  5. Contiguous Search Problem in Sierpiński Graphs
  6. Complexity of the Bollobás–Riordan Polynomial. Exceptional Points and Uniform Reductions
  7. One-Nonterminal Conjunctive Grammars over a Unary Alphabet
  8. Finding Similar Users in Social Networks
  9. A reducibility concept for problems defined in terms of ordered binary decision diagrams
  10. Tight Bounds for Distributed Minimum-Weight Spanning Tree Verification
  11. On the Flattest Common Supersequence Method for Deadlock-Free Routing in Arbitrary Networks
  12. Composing Stack-Attributed Tree Transducers
  13. Preface of STACS 2013 Special Issue
  14. Querying Data Sources that Export Infinite Sets of Views
  15. Sharing Resources at Nonuniform Access Rates
  16. Weighted Picture Automata and Weighted Logics
Search Result: