The paper considers several issues related to efficient use of tree automata in formal verification. First, a new efficient algorithm for inclusion checking on non-deterministic tree automata is proposed. The algorithm traverses the automaton downward, utilising antichains and simulations to optimise its run. Results of a set of experiments are provided, showing that such an approach often very...

The relation between the membrane structures of P systems and an extension of tree automata which introduces multisets in the transition function has been proposed in previous works. Here we propose two features of tree automata which have been previously studied (namely, reversibility and local testability) in order to extend them to multiset tree automata. The characterization of these famili...

The conceptual ideas that are intended to become the basis for the tree automata workbench MARBLES are sketched. The goal is to design and implement an extensible system that facilitates experiments with virtually any kind of algorithm on tree automata. Moreover, the system will be released with a library and an application programmer’s interface to make it accessible to anyone who wants to app...

We introduce the class of Rigid Tree Automata (RTA), an extension of standard bottom-up automata on ranked trees with distinguished states called rigid. Rigid states define a restriction on the computation of RTA on trees: two subtrees reaching the same rigid state in a run must be equal. RTA are able to perform local and global tests of equality between subtrees, non-linear tree pattern matchi...

introduction: virtual bronchoscopy is a reliable and efficient diagnostic method for primary symptoms of lung cancer. the segmentation of airways from ct images is a critical step for numerous virtual bronchoscopy applications. materials and methods: to overcome the limitations of the fuzzy connectedness method, the proposed technique, called fuzzy connectivity - fuzzy c-mean (fc-fcm), utilized...

Neuro-fuzzy systems-the combination of artiicial neural networks with fuzzy logic-are becoming increasingly popular. However, neuro-fuzzy systems need to be extended for applications which require context (e.g., speech, handwriting, control). Some of these applications can be modeled in the form of nite-state automata. Previously, it was proved that deterministic nite-state automata (DFAs) can ...