Zoltán Fülöp
YOU?
Author Swipe
View article: The generating power of weighted tree automata with initial algebra semantics
The generating power of weighted tree automata with initial algebra semantics Open
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,…
View article: Difficulties of catching-up in Central-Eastern Europe
Difficulties of catching-up in Central-Eastern Europe Open
The dissertation and the included articles primarily conduct exploratory investigations, followed by synthesising the results to draw conclusions. In the dissertation and in the article, I apply numerous quantitative methods. Mostly, they …
View article: Decidability Boundaries for the Finite-Image Property of Weighted Finite Automata
Decidability Boundaries for the Finite-Image Property of Weighted Finite Automata Open
A weighted finite automaton has the finite-image property if the image of the weighted language associated with it is finite. We show two undecidability results concerning the finite-image property of weighted finite automata over semiring…
View article: Relationship between gadolinium-based MRI contrast agent consumption and anthropogenic gadolinium in the influent of a wastewater treatment plant
Relationship between gadolinium-based MRI contrast agent consumption and anthropogenic gadolinium in the influent of a wastewater treatment plant Open
Gadolinium-based contrast agents (GBCAs) used in magnetic resonance imaging (MRI) are highly resistant in the environment. They pass through wastewater treatment plants (WWTPs) unhindered escaping degradation. Although GBCAs are subjects o…
View article: Weighted Tree Automata -- May it be a little more?
Weighted Tree Automata -- May it be a little more? Open
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 U…
View article: Ultrastructural Analysis of a Forming Embryonic Embodiment in the Adult Zebrafish Optic Tectum Surviving in Organotypic Culture
Ultrastructural Analysis of a Forming Embryonic Embodiment in the Adult Zebrafish Optic Tectum Surviving in Organotypic Culture Open
It has been shown that adult zebrafish are capable of regenerating regions of the central nervous system (CNS) after insult. Unlike in higher-order vertebrates where damage to the CNS leads to glial scar formation and permanent functional …
View article: Finite-image property of weighted tree automata over past-finite monotonic strong bimonoids
Finite-image property of weighted tree automata over past-finite monotonic strong bimonoids Open
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 p…
View article: Crisp-determinization of weighted tree automata over strong bimonoids
Crisp-determinization of weighted tree automata over strong bimonoids Open
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 se…
View article: Crisp-determinization of weighted tree automata over strong bimonoids
Crisp-determinization of weighted tree automata over strong bimonoids Open
We consider weighted tree automata (wta) over strong bimonoids and their\ninitial algebra semantics and their run semantics. There are wta for which\nthese semantics are different; however, for bottom-up deterministic wta and for\nwta over…
View article: Weighted Regular Tree Grammars with Storage
Weighted Regular Tree Grammars with Storage Open
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 weight…
View article: Weighted Regular Tree Grammars with Storage
Weighted Regular Tree Grammars with Storage Open
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 weight…
View article: Weighted Languages Recognizable by Weighted Tree Automata
Weighted Languages Recognizable by Weighted Tree Automata Open
Yields of recognizable weighted tree languages, yields of local weighted tree languages, and weighted context-free languages are related. It is shown that the following five classes of weighted languages are the same: (i) the class of weig…
View article: Evaluation and ranking of urban transportation projects
Evaluation and ranking of urban transportation projects Open
We present a Hungarian project portfolio planning case, in which special urban development
\nprojects have effects both on a whole town and its agglomeration. Working with the portfolio
\nwe had to solve two significant problems: How socia…
View article: Preface
Preface Open
The present volume is a collection of papers dedicated to the memory of Professor Zoltán Ésik who passed away unexpectedly in 2016.These papers were written by his friends, colleagues, and former students.
View article: Minimization of Deterministic Top-down Tree Automata
Minimization of Deterministic Top-down Tree Automata Open
We consider offline sensing unranked top-down tree automata in which the state transitions are computed by bimachines. We give a polynomial time algorithm for minimizing such tree automata when they are state-separated.
View article: Local Weighted Tree Languages
Local Weighted Tree Languages Open
Local weighted tree languages over semirings are introduced. For an arbitrary semiring, a weighted tree language is shown to be recognizable if it appears as the image of a local weighted tree language under a deterministic relabeling.