Zobrazeno 1 - 10
of 169
pro vyhledávání: '"Fülöp, Zoltán"'
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:
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
Publikováno v:
In Information and Computation December 2024 301 Part B
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
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, vol. 23 no. 1, Automata, Logic and Semantics (June 15, 2021) dmtcs:5943
We consider weighted tree automata (wta) over strong bimonoids and their initial algebra semantics and their run semantics. There are wta for which these semantics are different; however, for bottom-up deterministic wta and for wta over semirings, th
Externí odkaz:
http://arxiv.org/abs/1912.02660
Autor:
Laczovics, Attila, Csige, István, Szabó, Sándor, Tóth, Albert, Kálmán, Ferenc Krisztián, Tóth, Imre, Fülöp, Zoltán, Berényi, Ervin, Braun, Mihály
Publikováno v:
In Science of the Total Environment 15 June 2023 877
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.
Autor:
Fülöp, Zoltán, Vogler, Heiko
Publikováno v:
In Information and Computation January 2022 282
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol. 20 no. 1, Automata, Logic and Semantics (July 3, 2018) dmtcs:3664
We introduce weighted regular tree grammars with storage as combination of (a) regular tree grammars with storage and (b) weighted tree automata over multioperator monoids. Each weighted regular tree grammar with storage generates a weighted tree lan
Externí odkaz:
http://arxiv.org/abs/1705.06681
Autor:
Ésik, Zoltán, Fülöp, Zoltán
Publikováno v:
EPTCS 151, 2014
The 14th International Conference Automata and Formal Languages (AFL 2014) was held in Szeged, Hungary, from the 27th to the 29th of May, 2014. The conference was organized by the Department of Foundations of Computer Science of the University of Sze
Externí odkaz:
http://arxiv.org/abs/1405.5272