In this paper we consider the transformation from (minimal) Non-deterministic Finite Automata (NFAs) to Deterministic Finite Cover Automata (DFCAs). We want to compare the two equivalent accepting devices with respect to their number of states; this becomes in fact a comparison between the expression power of the nondeterministic device and the expression power of the deterministic with loops d...

We improve a recent result [Badr: Hyper-minimization inO(n). Int. J. Found. Comput. Sci. 20, 2009] for hyper-minimized nite automata. Namely, we present an O(n log n) algorithm that computes for a given deterministic nite automaton (dfa) an almostequivalent dfa that is as small as possible such an automaton is called hyper-minimal. Here two nite automata are almost-equivalent if and only if the...

Analysis by reduction is a method used in linguistics for checking the correctness of sentences of natural languages. This method is modelled by restarting automata. Here we study a new type of restarting automaton, the so-called t-sRLautomaton, which is an RL-automaton that is rather restricted in that it has a window of size 1 only, and that it works under a minimal acceptance condition. On t...

Network attacks that flow through network firewalls or network intrusion detection systems (NIDS) are often identifiable by the patterns of data that they contain. The patterns are normally represented by complex regular expressions which are matched at a very high speed. The regular expressions are built into their equivalent automata, using minimal hardware resources in order to detect variat...

Cerny’s conjecture is a 50 year old conjecture which concerns the combinatoral field of synchronizing automata. In particular, it postulates that the maximal length of the minimal reset word among all n-state automata is (n − 1). We present a proof for Pin’s Theorem, which applies Cerny’s conjecture to p-state automata consisting of a cycle and a nonpermutation, where p ≥ 3 is an odd prime. We ...

Automata are a useful tool in infinite state model checking, since they can represent infinite sets of integers and reals. However, analogous to BDDs to represent finite sets, an obstacle of an automata-based set representation is the sizes of the automata. In this paper, we generalize the notion of “don’t cares” for BDDs to word languages as a means to reduce the automata sizes. A general resu...

Previous work reports about SXSI, a fast XPath engine which executes tree automata over compressed XML indexes. Here, reasons are investigated why SXSI is so fast. It is shown that tree automata can be used as a general framework for fine grained XML query optimization. We define the “relevant nodes” of a query as those nodes that a minimal automaton must touch in order to answer the query. Thi...

This letter is a supplement of the table of the minimal cost one-dimensional linear hybrid cellular automata with the maximum length cycle by Zhang, Miller, and Muzio [IEE Electronics Letters, 27(18):1625-1627, August 1991].

Temporal synthesis attempts to construct reactive programs that satisfy a given declarative (LTL) formula. Practitioners have found it challenging work exclusively with specifications, and languages combine modelling specifications more useful. Synthesised controllers may also need pre-existing or manually constructed programs. In this paper we explore an approach combines of in the presence ex...

In this paper, we first introduce a network of learning automata, which we call it as distributed learning automata and then propose some iterative algorithms for solving stochastic shortest path problem. These algorithms use distributed learning automata to find a policy that determines a path from a source node to a destination node with minimal expected cost (length). In these algorithms, at...