The number of malicious software (malware) is growing out of control. Syntactic signature based detection cannot cope with such growth and manual construction of malware signature databases needs to be replaced by computer learning based approaches. Currently, a single modern signature capturing the semantics of a malicious behavior can be used to replace an arbitrarily large number of old-fash...

Terms considered as trees are very useful tools for presentation and manipulation of different data structures in Computer Science and Information Technology. Any work of the computer over the trees, for instance as graphical user interface (menus of the different windows), XML documents, definitions and description of hierarchial objects in C++ or Java programming etc. can be considered as run...

A context-free language is said to be simple if it is accepted by a single-state deterministic pushdown automaton with empty Stack acceptance. This paper proves that it is decidable whether a deterministic pushdown automaton (dpda) accepts a simple language. For this purpose, we prove that it is decidable whether a real-time dpda with empty stack acceptance accepts a simple language. To prove t...

We consider pushdown timed automata (PTAs) that are timed automata (with dense clocks) augmented with a pushdown stack. A configuration of a PTA includes a control state, dense clock values and a stack word. By using the pattern technique, we give a decidable characterization of the binary reachability (i.e., the set of all pairs of configurations such that one can reach the other) of a PTA. Si...

We give a new version of fuzzy alternating Büchi automata over distributive lattices: weights are putting in every leaf node of run trees rather than along with edges from every node to its children. Such settings are great benefit to obtain complement just by taking dual operation and replacing each final weight with its complement. We prove that L-fuzzy nondeterministic Büchi automata have th...

As an alternative to the two classical proofs for complemen-tation of B uchi automata, due to B uchi himself and to McNaughton, we outline a third approach, based on stratiied alternating automata with a \weak" acceptance condition. Building on work by Muller, Saoudi, Schupp (1986) and Kupferman and Vardi (1997), we present a streamlined version of this complementation proof. An essential point...

Abstract We show that the finite sequentiality problem is decidable for finitely ambiguous max-plus tree automata. A automaton a weighted over semiring. called if number of accepting runs on every bounded by global constant. The asks whether given automaton, there exist many deterministic automata whose pointwise maximum equivalent to automaton.

In this article, we develop a new and somewhat unexpected connection between higher-order model-checking and linear logic. Our starting point is the observation that once embedded in the relational semantics of linear logic, the Church encoding of a higher-order recursion scheme (HORS) comes together with a dual Church encoding of an alternating tree automata (ATA) of the same signature. Moreov...

Deterministic pushdown automata (DPDA) are a class of simple yet powerful models of computation. It has a finite set of states and a (pushdown) stack. Depending on the current state, the symbol at the top of the stack, and the symbol of the input word that has just been scanned, the automaton moves to a new state, either pushes or pops a symbol on the stack, and it is ready to scan the next sym...

We consider pushdown timed automata (PTAs) that are timed automata (with dense clocks) augmented with a pushdown stack. A configuration of a PTA includes a state, dense clock values and a stack word. By using the pattern technique, we give a decidable characterization of the binary reachability (i.e., the set of all pairs of configurations such that one can reach the other) of a PTA. Since a ti...