Zobrazeno 1 - 10
of 543
pro vyhledávání: '"Weighted tree automata"'
We consider the images of the initial algebra semantics of weighted tree automata over strong bimonoids (hence also over semirings). These images are subsets of the carrier set of the underlying strong bimonoid. We consider locally finite, weakly loc
Externí odkaz:
http://arxiv.org/abs/2405.20753
Autor:
Maletti, Andreas1 (AUTHOR), Nász, Andreea-Teodora1 (AUTHOR) nasz@informatik.uni-leipzig.de
Publikováno v:
Theory of Computing Systems. Feb2024, Vol. 68 Issue 1, p1-28. 28p.
Tree kernels have been proposed to be used in many areas as the automatic learning of natural language applications. In this paper, we propose a new linear time algorithm based on the concept of weighted tree automata for SubTree kernel computation.
Externí odkaz:
http://arxiv.org/abs/2302.01097
The HOM problem, which asks whether the image of a regular tree language under a given tree homomorphism is again regular, is known to be decidable [Godoy & Gim\'enez: The HOM problem is decidable. JACM 60(4), 2013]. However, the problem remains open
Externí odkaz:
http://arxiv.org/abs/2302.03434
Autor:
Fülöp, Zoltán, Vogler, Heiko
This is a book on weighted tree automata. We present the basic definitions and some of the important results in a coherent form with full proofs. The concept of weighted tree automata is part of Automata Theory and it touches the area of Universal Al
Externí odkaz:
http://arxiv.org/abs/2212.05529
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
We consider weighted tree automata over strong bimonoids (for short: wta). A wta $\mathcal{A}$ has the finite-image property if its recognized weighted tree language $[\![\mathcal{A}]\!]$ has finite image; moreover, $\mathcal{A}$ has the preimage pro
Externí odkaz:
http://arxiv.org/abs/2106.15867
Partition refinement is a method for minimizing automata and transition systems of various types. Recently, we have developed a partition refinement algorithm that is generic in the transition type of the given system and matches the run time of the
Externí odkaz:
http://arxiv.org/abs/2004.01250
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
In Theoretical Computer Science 5 June 2022 919:118-143